done

谢育欣 · 谢育欣 · commit efb2479a0c7e · 2023-12-17T00:07:07.000+08:00
diff --git a/src/com/leetcode/Main11.java b/src/com/leetcode/Main11.java
@@ -9,27 +9,28 @@
  */
 public class Main11 {
     public int maxArea(int[] height) {
-        if (height==null || height.length<=1)
+        if (height == null || height.length <= 1) {
             return 0;
-        int max = 0;
-        int l = 0;
-        int r = height.length-1;
-        int curCap = 0;
-        while (l < r) {
-            curCap = (r-l) * Math.min(height[l], height[r]);
-            if (curCap > max)
-                max = curCap;
-            if (height[l] <= height[r])
-                l++;
-            else
-                r--;
         }
-        return max;
+        int left = 0;
+        int right = height.length - 1;
+        int maxMl = Math.min(height[left], height[right]) * (right - left);
+        while (left != right) {
+            if (height[left] <= height[right]) {
+                left += 1;
+            } else {
+                right -= 1;
+            }
+            if (left != right) {
+                maxMl = Math.max(maxMl, Math.min(height[left], height[right]) * (right - left));
+            }
+        }
+        return maxMl;
     }
 
     public static void main(String[] args) {
         Main11 m = new Main11();
-        int[] height = {1,8,6,2,5,4,8,3,7};
+        int[] height = {2,3,4,5,18,17,6};
         System.out.println(m.maxArea(height));
     }
 }
diff --git a/src/com/leetcode/Main128.java b/src/com/leetcode/Main128.java
@@ -21,25 +21,26 @@
  */
 public class Main128 {
     public int longestConsecutive(int[] nums) {
-        if (nums == null || nums.length == 0)
+        if (nums == null || nums.length == 0) {
             return 0;
-        Set<Integer> set = new HashSet<>();
-        for(int num: nums) {
-            set.add(num);
         }
-        int res = 0;
-        for (int num: set) {
-            if (!set.contains(num-1)) {
-                int curRes = 1;
+        Set<Integer> numSet = new HashSet<>();
+        for (int num: nums) {
+            numSet.add(num);
+        }
+        int longestLen = 1;
+        for (Integer num: numSet) {
+            if (!numSet.contains(num - 1)) {
+                int currentLen = 1;
                 int curNum = num;
-                while (set.contains(curNum+1)) {
-                    curRes += 1;
+                while (numSet.contains(curNum + 1)) {
+                    currentLen += 1;
                     curNum += 1;
                 }
-                res = Math.max(res, curRes);
+                longestLen = Math.max(longestLen, currentLen);
             }
         }
-        return res;
+        return longestLen;
     }
 
     public static void main(String[] args) {
diff --git a/src/com/leetcode/Main283.java b/src/com/leetcode/Main283.java
@@ -0,0 +1,43 @@
+package com.leetcode;
+
+import java.util.Arrays;
+
+/**
+ * 283. 移动零
+ * 给定一个数组 nums，编写一个函数将所有 0 移动到数组的末尾，同时保持非零元素的相对顺序。
+ * 请注意 ，必须在不复制数组的情况下原地对数组进行操作。
+ * 示例 1:
+ *
+ * 输入: nums = [0,1,0,3,12]
+ * 输出: [1,3,12,0,0]
+ * 示例 2:
+ *
+ * 输入: nums = [0]
+ * 输出: [0]
+ */
+public class Main283 {
+    public void moveZeroes(int[] nums) {
+        int first = 0;
+        int second = 0;
+        while (second < nums.length) {
+            if (nums[second] != 0) {
+                nums[first] = nums[second];
+                second += 1;
+                first += 1;
+            } else {
+                second += 1;
+            }
+        }
+        while (first < nums.length) {
+            nums[first] = 0;
+            first += 1;
+        }
+    }
+
+    public static void main(String[] args) {
+        Main283 main283 = new Main283();
+        int[] nums = {0};
+        main283.moveZeroes(nums);
+        System.out.println(Arrays.toString(nums));
+    }
+}
diff --git a/src/com/leetcode/Main49.java b/src/com/leetcode/Main49.java
@@ -0,0 +1,27 @@
+package com.leetcode;
+
+import java.util.*;
+
+/**
+ * 49. 字母异位词分组
+ * 给你一个字符串数组，请你将 字母异位词 组合在一起。可以按任意顺序返回结果列表。
+ * 字母异位词 是由重新排列源单词的所有字母得到的一个新单词。
+ * 示例 1:
+ * 输入: strs = ["eat", "tea", "tan", "ate", "nat", "bat"]
+ * 输出: [["bat"],["nat","tan"],["ate","eat","tea"]]
+ */
+public class Main49 {
+    public List<List<String>> groupAnagrams(String[] strs) {
+        Map<String, List<String>> word2List = new HashMap<>();
+        for (int i = 0; i < strs.length; i++) {
+            char[] chars = strs[i].toCharArray();
+            Arrays.sort(chars);
+            String str = new String(chars);
+            List<String> stringList = word2List.getOrDefault(str, new ArrayList<>());
+            stringList.add(strs[i]);
+            word2List.put(str, stringList);
+        }
+        return new ArrayList<>(word2List.values());
+    }
+
+}
