{"id":780,"date":"2019-10-08T21:10:02","date_gmt":"2019-10-08T13:10:02","guid":{"rendered":"http:\/\/47.101.202.111\/?p=780"},"modified":"2021-03-07T00:17:15","modified_gmt":"2021-03-06T16:17:15","slug":"%e7%ae%97%e6%b3%95%e6%95%b0%e7%bb%84%e7%b1%bb-%e5%88%9d%e6%ad%a5","status":"publish","type":"post","link":"http:\/\/139.196.114.170\/?p=780","title":{"rendered":"[\u7b97\u6cd5]\u6570\u7ec4\u7c7b – \u521d\u6b65\u53ca\u4f18\u5316"},"content":{"rendered":"
> \u6570\u7ec4\u7c7b\u95ee\u9898\u4e00\u822c\u53ef\u4f18\u5316\u4e3aO(n)\u590d\u6742\u5ea6\u7684\u95ee\u9898\n> \u5e38\u7528\u6280\u672f\n    - \u5feb\u6162\u6307\u9488\u6ed1\u52a8\n    - \u9996\u5c3e\u6307\u9488\u5bf9\u649e\n<\/code><\/pre>\n
[toc]<\/p>\n
\u6700\u5927\u8fde\u7eed1\u7684\u4e2a\u6570<\/h3>\n
LeetCode485<\/a>
\n\u2460 [\u66b4\u529b] \u5355\u6b21\u904d\u5386\uff0c\u8fde\u7eed1\u76f4\u5230\u672b\u4f4d\u60c5\u51b5\u9700\u518d\u6b21\u8ba1\u7b97<\/p>\n
    public int findMaxConsecutiveOnes(int[] nums) {\n        int max = 0;\n        int cnt = 0;\n        for (int item : nums) {\n            if (item == 1) ++cnt;\n            else {\n                max = max > cnt ? max : cnt;\n                cnt = 0;\n            }\n        }\n        return max > cnt ? max : cnt;\n    }\n<\/code><\/pre>\n
\u2461 [\u53cc\u6307\u9488] \u6162\u6307\u9488\u6307\u54111\u5b50\u4e32\u9996\u5143\u7d20\uff0c\u5feb\u6307\u9488\u6307\u54111\u5b50\u4e32\u672b\u5143\u7d20\u4e0b\u4e00\u5143\u7d20\uff0c\u5dee\u4e3a\u6570\u76ee<\/p>\n
    public int findMaxConsecutiveOnes(int[] nums) {\n        int slow = 0;\n        int fast = 0;\n        int max = 0;\n        while (fast < nums.length) {\n            if (nums[fast] == 0) {\n                max = Math.max(max, fast - slow);\n                slow = ++fast;\n            }\n            else ++fast;\n        }\n        return Math.max(max, fast - slow);\n    }\n<\/code><\/pre>\n
\u53cd\u8f6c\u5b57\u7b26\u4e32<\/h3>\n
LeetCode344<\/a>
\n[\u53cc\u6307\u9488]<\/p>\n
    public void reverseString(char[] s) {\n        int slow = 0;\n        int fast = s.length - 1;\n        char tmp;\n        while(slow < fast) {\n            tmp = s[fast];\n            s[fast--] = s[slow];\n            s[slow++] = tmp;\n        }\n    }\n<\/code><\/pre>\n
\u6570\u7ec4\u62c6\u5206<\/h3>\n
LeetCode561<\/a>
\n\u2460 [\u8f6c\u4e49] \u6bcf\u4e2amin\u5bf9\u4e2d\u76f8\u5dee\u6700\u5c0f\u5373\u4e24\u4e24\u76f8\u90bb\u53ef\u4f7f\u548c\u6700\u5927\uff0c\u6392\u5e8f\u540e\u6311\u9009\u5373\u53ef<\/p>\n
    public int arrayPairSum(int[] nums) {\n        Arrays.sort(nums);\n        int sum = 0;\n        for (int i = 0; i < nums.length; i += 2)\n            sum += nums[i];\n        return sum;\n    }\n<\/code><\/pre>\n
\u2461 [\u2605] \u5f85\u7eed<\/p>\n
\u4e24\u6570\u4e4b\u548c<\/h3>\n
LeetCode1<\/a><\/p>\n
\u5df2\u77e5\u88ab\u51cf\u6570\uff0c\u904d\u5386\u6307\u5411\u7684\u5f53\u524d\u51cf\u6570\uff0c\u53ef\u8ba1\u7b97\u53e6\u4e00\u51cf\u6570\n\u5fc5\u987b\u7b2c\u4e8c\u6b21\u904d\u5386\u6216\u989d\u5916\u5185\u5b58\u5bfb\u627e\u53e6\u4e00\u51cf\u6570\u4e0b\u6807\n<\/code><\/pre>\n
\u2460 [\u66b4\u529b\u6c42\u89e3] \u6bcf\u6b21\u904d\u5386\u7b2c\u4e00\u51cf\u6570\uff0c\u5e76\u4ece\u6b64\u5411\u540e\u5bfb\u627e\u96f6\u4e00\u51cf\u6570\uff0c\u76f4\u5230\u6ee1\u8db3\u6761\u4ef6\u8fd4\u56de\u4e0b\u6807<\/p>\n
    public static int[] twoSum(int[] nums, int target) {\n        for (int i = 0; i < nums.length - 1; i++)\n            for (int j = i + 1; j < nums.length; j++)\n                if (nums[i] + nums[j] == target)\n                    return new int[]{i, j};\n        return null;\n    }\n<\/code><\/pre>\n
\u2461 [\u4e24\u6b21\u904d\u5386] \u54c8\u5e0c\u8868\u662f\u9ad8\u6548\u67e5\u627e\u7b97\u6cd5\uff0c\u7b2c\u4e00\u6b21\u904d\u5386\u5b58\u50a8\u7b2c\u4e00\u51cf\u6570\u4e0b\u6807\uff0c\u7b2c\u4e8c\u6b21\u904d\u5386\u901a\u8fc7\u8ba1\u7b97\u51fa\u8be5\u6570\u67e5\u627e\u4e0b\u6807\uff0c\u6ce8\u610f\u6392\u9664\u62ff\u5230\u540c\u4e00\u4e0b\u6807\u60c5\u51b5<\/p>\n
    public static int[] twoSum(int[] nums, int target) {\n        Map<Integer, Integer> map = new HashMap<>();\n        for (int i = 0; i < nums.length; i++)\n            map.put(nums[i], i);\n        for (int i = 0; i < nums.length; i++) {\n            int key = target - nums[i];\n            if (map.containsKey(key) && map.get(key) != i)\n                return new int[]{i, map.get(key)};\n        }\n        return null;\n    }\n<\/code><\/pre>\n
\u2462 [\u4e00\u6b21\u904d\u5386] \u67e5\u627e\u5f53\u524d\u6570\u662f\u5426\u4e3a\u5df2\u8ba1\u7b97\u7ed3\u679c<\/p>\n
    public static int[] twoSum(int[] nums, int target) {\n        Map<Integer, Integer> map = new HashMap<>();\n        for (int i = 0; i < nums.length; i++) {\n            if (map.containsKey(nums[i]))\n                return new int[]{map.get(nums[i]), i};\n            map.put(target - nums[i], i);\n        }\n        return null;\n    }\n<\/code><\/pre>\n
\u4e24\u6570\u4e4b\u548c – \u6709\u5e8f\u6570\u7ec4<\/h3>\n
LeetCode167<\/a><\/p>\n
[\u53cc\u6307\u9488] \u5229\u7528\u6392\u5e8f\u6027\u8d28\uff0c\u9996\u6307\u9488\u8db3\u591f\u5c0f\uff0c\u5c3e\u6307\u9488\u8db3\u591f\u5927\uff0c\u8981\u4e48\u89e3\u552f\u4e00\uff0c\u8981\u4e48\u65e0\u89e3<\/p>\n
    public static int[] twoSum(int[] nums, int target) {\n        int h = 0;\n        int t = nums.length - 1;\n        while(h < t) {\n            int s = nums[h] + nums[t];\n            if (s == target) return new int[] {h + 1, t + 1};\n            else if (s < target) h++;\n            else t--;\n        }\n        return null;\n    }\n<\/code><\/pre>\n
\u4e70\u5356\u80a1\u7968\u7684\u6700\u4f73\u65f6\u673a<\/h3>\n
LeetCode121<\/a>
\n[\u53cc\u6307\u9488]<\/p>\n
    public static int maxProfit(int[] prices) {\n        int slow = 0;\n        int fast = 1;\n        int temp = 0;\n        int max = 0;\n        while (fast < prices.length) {\n            if (prices[slow] > prices[fast])\n                slow = fast;\n            else {\n                temp = prices[fast] - prices[slow];\n                max = max > temp ? max : temp;\n            }\n            fast++;\n        }\n        return max;\n    }\n<\/code><\/pre>\n
\u5224\u65ad\u5b50\u5e8f\u5217<\/h3>\n
LeetCode392<\/a>
\n[\u53cc\u6307\u9488] \u4f9d\u6b21\u904d\u5386\u4e24\u5b57\u7b26\u4e32\u4e0b\u6807\u5339\u914d\uff0cO(n)\u590d\u6742\u5ea6<\/p>\n
    public boolean isSubsequence(String s, String t) {\n        int index = -1;\n        for (char c : s.toCharArray()) {\n            index = t.indexOf(c, index + 1);\n            if (index == -1) return false;\n        }\n        return true;\n    }\n<\/code><\/pre>\n
\u79fb\u52a8\u96f6<\/h3>\n
LeetCode283<\/a>
\n\u2460 [\u66b4\u529b] \u4ece\u96f6\u5f00\u59cb\u5230\u6700\u540e\u4e00\u4e2a\u975e\u96f6\u6570\u4f9d\u6b21\u524d\u79fb\u53bb\u9664\u6240\u59390\uff0c\u672b\u4f4d\u88650<\/p>\n
    public static void moveZeroes(int[] nums) {\n        int head = 0;\n        int tail = nums.length - 1;\n        while (nums[tail] == 0)\n            if (tail > 0) tail--;\n            else return;\n        while (head < tail) {\n            while (nums[head] == 0) {\n                for (int cur = head; cur < tail; cur++)\n                    nums[cur] = nums[cur + 1];\n                nums[tail] = 0;\n                tail--;\n            }\n            head++;\n        }\n    }\n<\/code><\/pre>\n
\u2461 [\u6539\u8fdb] \u7b2c\u4e00\u6b21\u904d\u5386\u7b5b\u9009\u51fa\u975e\u96f6\u6570\uff0c\u7b2c\u4e8c\u6b21\u904d\u5386\u5c06\u975e\u96f6\u6570\u4f9d\u6b21\u586b\u503c\uff0c\u5269\u4f59\u7f6e\u96f6<\/p>\n
    public void moveZeroes(int[] nums) {\n        int len = nums.length;\n        List<Integer> list = new ArrayList<>(len);\n        for (int i = 0; i < len; i++)\n            if (nums[i] != 0) list.add(nums[i]);\n        for (int i = 0; i < list.size(); i++)\n            nums[i] = list.get(i);\n        Arrays.fill(nums, list.size(), len, 0);\n    }\n<\/code><\/pre>\n
\u2462 [\u6539\u8fdb] \u5feb\u6307\u9488\u7b5b\u9009\u975e\u96f6\u6570\uff0c\u6162\u6307\u9488\u4f9d\u6b21\u586b\u5165\u975e\u96f6\u6570\uff0c\u5feb\u6307\u9488\u904d\u5386\u5b8c\u540e\u5176\u4f59\u586b\u96f6<\/p>\n
    public static void moveZeroes(int[] nums) {\n        int slow = 0;\n        int fast = 0;\n        for (; fast < nums.length; fast++)\n            if (nums[fast] != 0) nums[slow++] = nums[fast];\n        for(; slow < nums.length; slow++)\n            nums[slow] = 0;\n    }\n<\/code><\/pre>\n
\u2463 [\u6539\u8fdb] \u6162\u6307\u9488\u627e\u5230\u9996\u4e2a\u96f6\u9879\uff0c\u5feb\u6307\u9488\u4ece\u6162\u6307\u9488\u51fa\u53d1\u627e\u5230\u7b2c\u4e00\u4e2a\u975e\u96f6\u9879\uff0c\u503c\u4ea4\u6362<\/p>\n
    public static void moveZeroes(int[] nums) {\n        int slow = 0;\n        int fast = 0;\n        while (fast < nums.length) {\n            if (nums[slow] != 0) fast = ++slow;\n            else {\n                if (nums[fast] == 0) fast++;\n                else {\n                    nums[slow] = nums[fast];\n                    nums[fast] = 0;\n                }\n            }\n        }\n    }\n<\/code><\/pre>\n
\u2464 [\u6539\u8fdb] \u6162\u6307\u9488\u8bb0\u5f55\u9996\u4e2a0\u4e0e\u5176\u540e\u5feb\u6307\u9488\u8bb0\u5f55\u7684\u9996\u4e2a\u975e\u96f6\u6570\u4ea4\u6362\uff0c\u6162\u6307\u9488\u4f9d\u6b21\u586b\u503c\uff0c\u9996\u4f4d\u975e\u96f6\u503c\u4e0e\u81ea\u8eab\u4ea4\u6362\u4f4d\u7f6e\u4e0d\u52a8<\/p>\n
    public static void moveZeroes(int[] nums) {\n        int slow = 0;\n        int fast = 0;\n        for (; fast < nums.length; fast++)\n            if (nums[fast] != 0) {\n                int temp = nums[slow];\n                nums[slow++] = nums[fast];\n                nums[fast] = temp;\n            }\n    }\n<\/code><\/pre>\n
\u79fb\u9664\u5143\u7d20<\/h3>\n
LeetCode27<\/a>
\n\u2460 [\u8fc1\u79fb] \u76f8\u5f53\u4e8e\u79fb\u52a8\u96f6\u95ee\u9898\uff0cslow\u6240\u6307\u5373\u4e3a\u9664\u53bb\u8be5\u503c\u6570\u7ec4\u672b\u5c3e<\/p>\n
    public int removeElement(int[] nums, int val) {\n        int fast = 0;\n        int slow = 0;\n        for(;fast < nums.length; fast++){\n            if(nums[fast] != val){\n                int temp = nums[slow];\n                nums[slow++] = nums[fast];\n                nums[fast] = temp;\n            }\n            return slow;\n        }\n    }\n<\/code><\/pre>\n
\u2461 [\u6539\u8fdb] \u5feb\u6307\u9488\u7b5b\u9009\uff0c\u6162\u6307\u9488\u53ea\u9700\u6309\u5e8f\u586b\u503c\u5373\u53ef<\/p>\n
    public int removeElement(int[] nums, int val) {\n        int fast = 0;\n        int slow = 0;\n        for(;fast < nums.length; fast++)\n            if(nums[fast] != val)\n                nums[slow++] = nums[fast];\n        return slow;\n    }\n<\/code><\/pre>\n
\u2462 [\u6539\u8fdb] \u51cf\u5c0f\u6570\u7ec4\u51cf\u5c11\u904d\u5386\u6b21\u6570\uff0c\u672b\u5c3e\u503c\u66ff\u6362\u8be5\u503c<\/p>\n
    public int removeElement(int[] nums, int val) {\n        int i = 0;\n        int n = nums.length;\n        while(i < n)\n            if(nums[i] == val)\n                nums[i] = nums[--n];\n            else i++;\n        return n;\n    }\n<\/code><\/pre>\n
\u5220\u9664\u91cd\u590d\u9879\u2160<\/h3>\n
LeetCode26<\/a>
\n\u2460 [\u7ebf\u6027\u8868] \u7ebf\u6027\u8868\u5220\u9664\u601d\u60f3\u9700\u8981\u79fb\u52a8\u5927\u91cf\u5c3e\u90e8\u5143\u7d20<\/p>\n
    public int removeDuplicates(int[] nums) {\n        int tail = nums.length;\n        int i = 1;\n        while (i < tail) {\n            if (nums[i - 1] == nums[i]) {\n                for (int j = i; j < tail - 1; j++) {\n                    nums[j] = nums[j + 1];\n                }\n                tail--;\n            } else {\n                i++;\n            }\n        }\n        return tail;\n    }\n<\/code><\/pre>\n
\u2461 [\u53cc\u6307\u9488] \u5feb\u6307\u9488\u5bf9\u6bd4\u7b5b\u9009\uff0c\u6162\u6307\u9488\u4f9d\u6b21\u8986\u76d6<\/p>\n
    public int removeDuplicates(int[] nums) {\n        int slow = 0;\n        int fast = 1;\n        for(; fast < nums.length; fast++)\n            if(nums[fast] != nums[slow])\n                nums[++slow] = nums[fast];\n        return ++slow;\n    }\n<\/code><\/pre>\n
\u2462 [\u6539\u8fdb] \u53d6\u6d88\u5f00\u59cb\u4f4d\u7f6e\u4e0d\u540c\u503c\u7684\u539f\u5730\u590d\u5236<\/p>\n
    public int removeDuplicates(int[] nums) {\n        int slow = 0;\n        int fast = 1;\n        for(; fast < nums.length; fast++)\n            if(nums[fast] != nums[slow])\n                if(fast != slow)\n                    nums[++slow] = nums[fast];\n        return ++slow;\n    }\n<\/code><\/pre>\n
\u5220\u9664\u91cd\u590d\u9879\u2161<\/h3>\n
LeetCode80<\/a>
\n\u2460 [\u53cc\u6307\u9488] \u5feb\u6307\u9488\u7b5b\u9009\u4e0e\u6162\u6307\u9488\u5143\u7d20\u5bf9\u6bd4\uff0c\u6162\u6307\u9488\u4f9d\u6b21\u586b\u503c\uff0c\u76f4\u5230\u540c\u4e00\u5143\u7d20\u8ba1\u6570\u52302\u505c\u6b62\u66f4\u65b0<\/p>\n
    public int removeDuplicates(int[] nums) {\n        int slow = 0;\n        int fast = 1;\n        int count = 1;\n        for (; fast < nums.length; fast++) {\n            if (nums[fast] != nums[slow]) {\n                nums[++slow] = nums[fast];\n                count = 1;\n            } else {\n                if (count != 2) {\n                    nums[++slow] = nums[fast];\n                    count++;\n                }\n            }\n        }\n        return ++slow;\n    }\n<\/code><\/pre>\n
\u2461 [\u6539\u8fdb] \u6162\u6307\u9488\u8bb0\u5f55\u6700\u540e\u4e00\u4e2a\u5199\u5165\u5143\u7d20\uff0c\u5feb\u6307\u9488\u8bb0\u5f55\u5f85\u63d2\u5165\u6162\u6307\u9488\u4e4b\u540e\u5143\u7d20\u3002\u5feb\u6307\u9488\u4e0e\u6162\u6307\u9488\u524d\u4e00\u503c\u76f8\u540c\uff0c\u8bf4\u660e\u5f85\u63d2\u5143\u7d20\u4e0e\u524d\u4e24\u4e2a\u5143\u7d20\u5747\u76f8\u540c\u4e0d\u9700\u63d2\u5165\uff0c\u5feb\u6307\u9488\u5411\u524d\u904d\u5386\u5bfb\u627e\u65b0\u503c\u5373\u53ef\u3002\u82e5\u4e0d\u540c\uff0c\u5219\u8bf4\u660e\u5f85\u63d2\u503c\u8981\u4e48\u662f\u7b2c\u4e8c\u4e2a\u503c\uff0c\u8981\u4e48\u662f\u65b0\u503c\uff0c\u63d2\u5728\u6162\u6307\u9488\u4e4b\u540e\u5e76\u66f4\u65b0\u6162\u6307\u9488\u3002\u6bcf\u4e2a\u503c\u6700\u591a\u53ef\u51fa\u73b0\u4e24\u6b21\uff0c\u5219\u524d\u4e24\u4e2a\u5fc5\u5728\u7ed3\u679c\u96c6\u4e2d\uff0c\u4ece\u7b2c\u4e09\u4e2a\u5f00\u59cb\u904d\u5386\u5373\u53ef\u3002<\/p>\n
    public int removeDuplicates(int[] nums) {\n        int slow = 1;\n        int fast = 2;\n        for(; fast < nums.length; fast++)\n            if(nums[slow - 1] != nums[fast])\n                nums[++slow] = nums[fast];\n        return ++slow;\n    }\n<\/code><\/pre>\n
\u2462 [\u6539\u8fdb] \u82e5\u5f53\u524d\u6570\u5927\u4e8e\u524d\u4e8c\u4f4d\u7f6e\u6570\uff0c\u8bf4\u660e\u662f\u51fa\u73b0\u65b0\u503c\u6216\u7b2c\u4e8c\u4e2a\u540c\u6837\u503c\uff0c\u6162\u6307\u9488\u4f9d\u6b21\u586b\u503c<\/p>\n
    public int removeDuplicates(int[] nums) {\n        if(nums.length <= 2) return nums.length;\n        for (int i = 2; i < nums.length; i++)\n            if (nums[i] != nums[i - 2])\n                nums[i++] = n;\n        return i;\n    }\n<\/code><\/pre>\n
\u2463 [\u63a8\u5e7f] \u5220\u9664\u91cd\u590d\u9879\uff0c\u6bcf\u4e2a\u5143\u7d20\u6700\u591a\u51fa\u73b0N\u6b21<\/p>\n
    public int removeDuplicates(int[] nums) {\n        int i = 0;\n        for (int n : nums)\n            if (i < N || N > nums[i - N])\n                nums[i++] = n;\n        return i;\n    }\n<\/code><\/pre>\n
\u989c\u8272\u5206\u7c7b<\/h3>\n
LeetCode80<\/a>
\n\u2460 [\u53cc\u6307\u9488\/\u57fa\u6570\u6392\u5e8f] \u5feb\u6307\u9488\u904d\u5386\u4e24\u6b21\u6570\u7ec4\uff0c\u6bcf\u8f6e\u5feb\u6307\u9488\u4ece\u6162\u6307\u9488\u51fa\u53d1\u9012\u589e\u5e76\u7b5b\u9009\u8be5\u503c\uff0c\u4ea4\u6362\u8be5\u503c\u5230\u6162\u6307\u9488\u4f4d\u7f6e\u586b\u5165<\/p>\n
    public static void sortColors(int[] nums) {\n        int cur = 0;\n        int slow = 0;\n        for (; cur <= 1; cur++) {\n            for (int fast = slow; fast < nums.length; fast++) {\n                if (cur == nums[fast]) {\n                    int temp = nums[slow];\n                    nums[slow++] = nums[fast];\n                    nums[fast] = temp;\n                }\n            }\n        }\n    }\n<\/code><\/pre>\n
\u2461 [\u6539\u8fdb] \u4e09\u8def\u5feb\u901f\u6392\u5e8f\u3002\u4e00\u6b21\u5411\u524d\u904d\u5386\uff0c\u90470\u4ea4\u6362\u5230\u6700\u5de6\uff0c\u90472\u4ea4\u6362\u5230\u6700\u53f3\u3002\u76f8\u5f53\u4e8e\u4e00\u4e2a\u5feb\u6307\u9488\u904d\u5386\uff0c\u4e24\u4e2a\u6162\u6307\u9488\u5206\u522b\u4ece\u4e24\u7aef\u5411\u4e2d\u95f4\u4f9d\u6b21\u586b\u5165\u6700\u5c0f\u503c\u548c\u6700\u5927\u503c<\/p>\n
    public static void sortColors(int[] nums) {\n        int i0 = 0;\n        int i1 = 0;\n        int i2 = nums.length - 1;\n        int tmp;\n        while (i1 <= i2) {\n            if (nums[i1] == 0) {\n                tmp = nums[i0];\n                nums[i0++] = nums[i1];\n                nums[i1++] = tmp;\n            }\n            else if (nums[i1] == 2) {\n                tmp = nums[i2];\n                nums[i2--] = nums[i1];\n                nums[i1++] = tmp;\n            }\n            else i1++;\n        }\n    }\n<\/code><\/pre>\n
\u5bfb\u627e\u6570\u7ec4\u7684\u4e2d\u5fc3\u7d22\u5f15<\/h3>\n
LeetCode724<\/a><\/p>\n
\u6ce8\u610f\u4e0b\u68070\u5904\u5728\u53f3\u4fa7\u52a0\u548c\u4e3a0\u65f6\u4e5f\u4e3a\u4e2d\u5fc3\u7d22\u5f15\uff0clength - 1\u540c\u7406\n<\/code><\/pre>\n
\u2460 [\u66b4\u529b] \u9012\u589e\u7d22\u5f15\uff0c\u6bcf\u6b21\u9a8c\u8bc1\u5de6\u53f3\u90e8\u5206\u548c<\/p>\n
    public int pivotIndex(int[] nums) {\n        for(int i = 0; i < nums.length; i++) {\n            int left = 0;\n            int right = 0;\n            for(int j = 0; j < i; j++)\n                left += nums[j];\n            for(int k = nums.length - 1; k > i; k--)\n                right += nums[k];\n            if(left == right) return i;\n        }\n        return -1;\n    }\n<\/code><\/pre>\n
\u2461 [\u6539\u8fdb] \u51cf\u5c11\u53f3\u4fa7\u548c\u8ba1\u7b97\uff0c\u53f3\u4fa7\u548c = \u603b\u548c – \u5de6\u4fa7\u548c – \u5f53\u524d\u7d22\u5f15\u503c\u3002\u540c\u7406\u6709 2 * \u5de6\u4fa7\u548c = \u603b\u548c – \u5f53\u524d\u7d22\u5f15\u503c<\/p>\n
    public int pivotIndex(int[] nums) {\n        int sum = 0;\n        int lef = 0;\n        for(int num: nums) sum += num;\n        for(int i = 0; i < nums.length; i++) {\n            if(lef == sum - lef - nums[i]) return i;\n            lef += nums[i];\n        }\n        return -1;\n    }\n<\/code><\/pre>\n
\u81f3\u5c11\u662f\u5176\u4ed6\u6570\u5b57\u4e24\u500d\u7684\u6700\u5927\u6570<\/h3>\n
LeetCode747<\/a>
\n\u2460 [\u4e24\u6b21\u904d\u5386] \u4e00\u6b21\u627e\u6700\u5927\u503c\uff0c\u7b2c\u4e8c\u6b21\u9a8c\u8bc1\u6761\u4ef6<\/p>\n
    public static int dominantIndex(int[] nums) {\n        int max = 0;\n        for (int i = 0; i < nums.length; ++i)\n            if (nums[i] > nums[max])\n                max = i;\n        for (int i = 0; i < nums.length; ++i)\n            if (max != i && nums[max] <= 2 * nums[i])\n                return -1;\n        return maxIndex;\n    }\n<\/code><\/pre>\n
\u2461 [\u4e00\u6b21\u904d\u5386] \u4e00\u6b21\u904d\u5386\u7b5b\u9009\u6700\u5927\u503c\u548c\u6b21\u5927\u503c<\/p>\n
    public static int dominantIndex(int[] nums) {\n        if (nums.length < 1) return -1;\n        if (nums.length == 1) return 0;\n        int max = 0;\n        int smax = Integer.MIN_VALUE;\n        for (int i = 1; i < nums.length; i++) {\n            if (nums[i] > nums[max]) {\n                smax = nums[max];\n                max = i;\n            }\n            else if (nums[i] > smax && nums[max] != nums[i])\n                smax = nums[i];\n        }\n        return nums[max] >= smax * 2 ? max : -1;\n    }\n<\/code><\/pre>\n
\u52a0\u4e00<\/h3>\n
LeetCode66<\/a><\/p>\n
    public int[] plusOne(int[] digits) {\n        for(int i = digits.length - 1; i >= 0; i--) {\n            if(digits[i] == 9) digits[i] = 0;\n            else{\n                digits[i]++;\n                return digits;\n            }\n        }\n        int arr = new int[digits.length + 1];\n        arr[0] = 1;\n        return arr;\n    }\n<\/code><\/pre>\n
\u5bf9\u89d2\u7ebf\u904d\u5386<\/h3>\n
LeetCode498<\/a>
\n\u2460 [\u6570\u5b57\u89c4\u5f8b] \u5217\u51fa\u904d\u5386\u987a\u5e8f\u4e0b\u6807\u5bfb\u627e\u89c4\u5f8b\u3002\u4ec5\u9002\u7528\u4e8e\u65b9\u9635\uff0cM\u00d7N\u77e9\u9635\u62a5\u9519<\/p>\n
    public static int[] findDiagonalOrder(int[][] matrix) {\n        if (matrix == null) return new int[0];\n        if (matrix.length == 0) return new int[0];\n        if (matrix[0].length == 0) return new int[0];\n        int count = 0, n = matrix.length;\n        int[] nums = new int[n * matrix[0].length];\n        for (int i = 0; i < 2 * n - 1; i++) {\n            if (i < n)\n                if (i % 2 == 1)\n                    for (int j = 0; j <= i; j++)\n                        nums[count++] = matrix[j][i - j];\n                else\n                    for (int j = i; j >= 0; j--)\n                        nums[count++] = matrix[j][i - j];\n            else\n                if (i % 2 == 1)\n                    for (int j = i - n + 1; j <= n - 1; j++)\n                        nums[count++] = matrix[j][i - j];\n                else\n                    for (int j = n - 1; j >= i - n + 1; j--)\n                        nums[count++] = matrix[j][i - j];\n        }\n        return nums;\n    }\n<\/code><\/pre>\n
\u2461 [\u79fb\u52a8\u4e0b\u6807] \u4f9d\u6b21\u79fb\u52a8\u4e0b\u6807\uff0c\u5750\u6807\u548c\u4e3a\u904d\u5386\u5c42\u6570\uff0c\u5c42\u6570\u4e3a\u5076\u6570\u5411\u53f3\u4e0a\u79fb\u52a8\uff0c\u5947\u6570\u5de6\u4e0b\u79fb\u52a8\uff0c\u6bcf\u5230\u5c42\u672b\u8fb9\u754c\u6539\u53d8\u79fb\u52a8\u65b9\u5411\u3002<\/p>\n
\u4e3b\u5bf9\u89d2\u7ebf\u5230\u8fbe\u5c42\u672b\u5143\u7d20\u540e\u6539\u53d8\u65b9\u5411\u4e0e\u6b21\u5bf9\u89d2\u7ebf\u6539\u53d8\u65b9\u5411\u4e0d\u540c\n\u987b\u9996\u5148\u5224\u65ad\u662f\u5426\u4e3b\u5bf9\u89d2\u7ebf\uff0c\u518d\u5224\u65ad\u662f\u5426\u6b21\u5bf9\u89d2\u7ebf\u5c42\u672b\u5143\u7d20\n\u98a0\u5012\u5219\u8d85\u51fa\u6570\u7ec4\u8fb9\u754c\n<\/code><\/pre>\n
    public int[] findDiagonalOrder(int[][] matrix) {\n        if (matrix == null) return new int[0];\n        if (matrix.length == 0) return new int[0];\n        if (matrix[0].length == 0) return new int[0];\n        int r = 0, c = 0;\n        int row = matrix.length;\n        int col = matrix[0].length;\n        int[] arr = new int[row * col];\n        for (int i = 0; i < arr.length; i++) {\n            arr[i] = matrix[r][c];\n            if ((r + c) % 2 == 0) {\n                if (c == col - 1) r++;\n                else if (r == 0) c++;\n                else { r--; c++; }\n            }\n            else {\n                if (r == row - 1) c++;\n                else if (c == 0) r++;\n                else { r++; c--; }\n            }\n        }\n        return arr;\n    }\n<\/code><\/pre>\n
\u65cb\u8f6c\u6570\u7ec4<\/h3>\n
LeetCode189<\/a>
\n\u2460 [\u66b4\u529b\u6c42\u89e3] \u6bcf\u6b21\u6279\u91cf\u79fb\u52a8\u4e00\u4f4d\u79fb\u52a8k\u6b21<\/p>\n
\u4f9d\u6b21\u79fb\u52a8\uff0c\u5355\u72ec\u5904\u7406\u672b\u4f4d\u548c\u5934\u90e8\n<\/code><\/pre>\n
    public void rotate(int[] nums, int k) {\n        int l = nums.length;\n        if (l > 0) {\n            for (int i = 0; i < k; i++) {\n                int t = nums[l - 1];\n                for (int j = l - 1; j > 0; j--)\n                    nums[j] = nums[j - 1];\n                nums[0] = t;\n            }\n        }\n<\/code><\/pre>\n
\u4fdd\u5b58\u88ab\u8986\u76d6\u503c\uff0c\u4f9b\u4e0b\u6b21\u5faa\u73af\u8d4b\u503c\n<\/code><\/pre>\n
    public void rotate(int[] nums, int k) {\n        int p = nums[l - 1];\n        for (int j = 0; j < l; j++) {\n            int t = nums[j];\n            nums[j] = p;\n            p = t;\n        }\n    }\n<\/code><\/pre>\n
\u2461 [\u989d\u5916\u5185\u5b58] \u5f00\u8f9f\u53e6\u5916\u4e00\u4e2a\u6570\u7ec4\uff0c\u76f4\u63a5\u653e\u5165\u6b63\u786e\u4f4d\u7f6e<\/p>\n
    public void rotate(int[] nums, int k) {\n        if (nums.length > 1) {\n            int[] arr = new int[nums.length];\n            for (int i = 0; i < nums.length; i++)\n                arr[(i + k) % nums.length] = nums[i];\n            for (int i = 0; i < nums.length; i++)\n                nums[i] = arr[i];\n        }\n    }\n<\/code><\/pre>\n
\u2462 [\u2605] \u5f85\u7eed<\/p>\n
\u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4<\/h3>\n
LeetCode209<\/a>
\n\u2460 [\u66b4\u529b\u6c42\u89e3] \u679a\u4e3e\u4e0b\u6807\u6240\u6709\u60c5\u51b5<\/p>\n
    public static int minSubArrayLen(int s, int[] nums) {\n        int min = Integer.MAX_VALUE;\n        for (int i = 0; i < nums.length; i++) {\n            for (int j = i; j < nums.length; j++) {\n                int sum = 0;\n                for (int k = i; k <= j; k++)\n                    sum += nums[k];\n                if (sum >= s) {\n                    int val = j - i + 1;\n                    if (min > val) min = val;\n                }\n            }\n        }\n        return min == Integer.MAX_VALUE ? 0 : min;\n    }\n<\/code><\/pre>\n
\u2461 [\u4f18\u5316] \u5f85\u7eed
\n\u2462 [\u6ed1\u52a8\u7a97\u53e3] \u6162\u6307\u9488\u539f\u5730\u7b49\u5f85\uff0c\u5feb\u6307\u9488\u5411\u524d\u904d\u5386\u52a0\u548c\uff0c\u76f4\u5230\u548c\u6ee1\u8db3\u6761\u4ef6\u3002\u6162\u6307\u9488\u524d\u79fb\u540e\u91cd\u590d\u4e0a\u8ff0\u64cd\u4f5c\uff0c\u8bb0\u5f55\u6700\u5c0f\u5e8f\u5217\u957f\u5ea6\u3002\u5feb\u6307\u9488\u5230\u8fbe\u672b\u5c3e\u505c\u6b62\u3002<\/p>\n
    public int minSubArrayLen(int s, int[] nums) {\n        int l = 0, r = 0;\n        int sum = 0, tmp = 0;\n        int min = Integer.MAX_VALUE;\n        while (l < nums.length) {\n            if (sum < s && r < nums.length)\n                sum += nums[r++];\n            else sum -= nums[l++];\n            tmp = r - l;\n            if (min > tmp && sum >= s)\n                min = tmp;\n        }\n    }\n<\/code><\/pre>\n
\u8be6\u7ec6\u8bf4\u660e<\/strong><\/p>\n
\u8f93\u5165 [2, 3, 1, 2, 4, 3]\n<\/code><\/pre>\n
\nwindow  l       r       sum     min     tmp\n2       0       1       2       MAX     1\n23      0       2       5       MAX     2\n231     0       3       6       MAX     3\n2312    0       4       8       4       4\n312     1       4       6       4       3\n3124    1       5       10      4       4\n124     2       5       7       3       3\n24      3       5       6       3       2\n243     3       6       9       3       3\n43      4       6       7       2       2\n3       5       6       3       2       1\n        6       6       0       2       0\n<\/pre>\n
\u2463 [\u4f18\u5316] \u4ec5\u5728\u7f29\u5c0f\u7a97\u53e3\uff08\u6162\u6307\u9488\u524d\u79fb\uff09\u65f6\u8ba1\u7b97\u6bd4\u8f83\u4e0a\u6b21\u957f\u5ea6<\/p>\n
    public int minSubArrayLen(int s, int[] nums) {\n        int l = 0, r = 0;\n        int sum = 0, tmp = 0;\n        int min = Integer.MAX_VALUE;\n        while (l < nums.length) {\n            if (sum < s && r < nums.length)\n                sum += nums[r++];\n            else {\n                if (sum < s) break;\n                tmp = r - l;\n                if (min > tmp)\n                    min = tmp;\n                sum -= nums[l++];\n            }\n        }\n        return min == Integer.MAX_VALUE ? 0 : min;\n    }\n<\/code><\/pre>\n
\u8be6\u7ec6\u8bf4\u660e<\/strong><\/p>\n
\u8f93\u5165 [2, 3, 1, 2, 4, 3]\n<\/code><\/pre>\n
\nwindow      l       r       sum     min     tmp\n2           0       1       2       MAX     0\n23          0       2       5       MAX     0\n231         0       3       6       MAX     0\n2312        0       4       8       MAX     0\n312         1       4       6       4       4\n3124        1       5       10      4       4\n124         2       5       7       4       4\n24          3       5       6       3       3\n243         3       6       9       3       3\n43          4       6       7       3       3\n3           5       6       3       2       2\n<\/pre>\n
\u6700\u5927\u5b50\u5e8f\u548c<\/h3>\n
LeetCode53<\/a>
\n\u4e0d\u65ad\u66f4\u65b0\u6700\u5927\u548c\uff0c\u5176\u4e2d\u8d1f\u548c\u5bf9\u6700\u5927\u548c\u65e0\u8d21\u732e\uff0c\u6e05\u96f6\u91cd\u8ba1<\/p>\n
    public int maxSubArray(int[] nums) {\n        int cur = 0;\n        int sum = 0;\n        int max = nums[0];\n        while (cur < nums.length) {\n            sum += nums[cur];\n            max = sum > max ? sum : max;\n            sum = sum > 0 ? sum : 0;\n            cur++;\n        }\n        return max;\n    }\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"
> \u6570\u7ec4\u7c7b\u95ee\u9898\u4e00\u822c\u53ef\u4f18\u5316\u4e3aO(n)\u590d\u6742\u5ea6\u7684\u95ee\u9898 > \u5e38\u7528\u6280\u672f – \u5feb\u6162\u6307\u9488\u6ed1\u52a8 – \u9996\u5c3e\u6307\u9488\u5bf9\u649e  … <\/p>\n
\u7ee7\u7eed\u9605\u8bfb\u201c[\u7b97\u6cd5]\u6570\u7ec4\u7c7b – \u521d\u6b65\u53ca\u4f18\u5316\u201d<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[12],"tags":[],"jetpack_featured_media_url":"","_links":{"self":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/780"}],"collection":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=780"}],"version-history":[{"count":44,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/780\/revisions"}],"predecessor-version":[{"id":1033,"href":"http:\/\/139.196.114.170\/index.php?rest_route=\/wp\/v2\/posts\/780\/revisions\/1033"}],"wp:attachment":[{"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=780"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=780"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/139.196.114.170\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=780"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}