{"id":307,"date":"2025-12-06T15:38:38","date_gmt":"2025-12-06T07:38:38","guid":{"rendered":"https:\/\/jdoxk3.cn\/?p=307"},"modified":"2025-12-11T17:09:42","modified_gmt":"2025-12-11T09:09:42","slug":"%e5%8a%9b%e6%89%a3hot100%e5%88%b7%e9%a2%98%e5%bf%83%e5%be%97%e6%80%bb%e7%bb%93","status":"publish","type":"post","link":"https:\/\/jdoxk3.cn\/index.php\/2025\/12\/06\/%e5%8a%9b%e6%89%a3hot100%e5%88%b7%e9%a2%98%e5%bf%83%e5%be%97%e6%80%bb%e7%bb%93\/","title":{"rendered":"\u529b\u6263hot100\u5237\u9898\u5fc3\u5f97\u603b\u7ed3\uff081\uff09"},"content":{"rendered":"\n

1.\u4e24\u6570\u4e4b\u548c\uff081\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n

\u66b4\u529b\u7834\u89e3<\/h2>\n\n\n\n

\u6211\u9996\u5148\u60f3\u5230\u7684\u662f\u66b4\u529b\u7834\u89e3\uff0c\u4f7f\u7528\u53cc\u5faa\u73af\uff0c\u4f46\u8fd9\u79cd\u65b9\u6cd5\u65f6\u95f4\u590d\u6742\u5ea6\u592a\u9ad8\uff0c\u597d\u5728\u5bb9\u6613\u60f3\u5230<\/p>\n\n\n\n

class Solution(object):\n    def twoSum(self, nums, target):\n        for i in range(len(nums)):\n            for j in range(i+1 , len(nums)):\n                if nums[i] + nums[j] == target:\n                    return[i,j]<\/code><\/pre>\n\n\n\n
\u54c8\u5e0c\u6cd5<\/h2>\n\n\n\n
\u5728\u6211\u7406\u89e3\u91cc\uff0c\u8fd9\u79cd\u505a\u6cd5\u5f88\u8ba8\u5de7\uff0c\u5148\u5b9a\u4e49\u4e00\u4e2aidx\u5b57\u5178\uff08\u7528\u6765\u5b58\u653e\u7d22\u5f15\u503c\uff09\uff0c\u7136\u540e\u5bf9nums\u7684\u5143\u7d20\u8fdb\u884c\u679a\u4e3e\uff0c\u5224\u65adtarget – x\u662f\u5426\u5df2\u7ecf\u5b58\u653e\u5728idx\u91cc\u9762\uff0c\u5982\u679c\u5df2\u7ecf\u5b58\u5728\uff0c\u5c31\u8f93\u51fa\u8fd4\u56de\u503c\uff0c\u5982\u679c\u4e0d\u5b58\u5728\u5c31idx[x] = j\u5c06\u5bf9\u5e94\u7684\u6570\u503c\u4ee5\u54c8\u5e0c\u65b9\u5f0f\u5b58\u653e<\/p>\n\n\n\n
class Solution(object):\n    def twoSum(self, nums, target):\n        idx = {}\n        for j , x in enumerate(nums):\n            if target - x in idx:\n                return [idx[target - x], j]\n            idx[x] = j<\/code><\/pre>\n\n\n\n
2.\u5b57\u6bcd\u5f02\u4f4d\u8bcd\u5206\u7ec4\uff0849\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u521a\u770b\u5230\u8fd9\u9053\u9898\uff0c\u7531\u4e8e\u6211\u7684\u7b97\u6cd5\u89c1\u8bc6\u8fc7\u4e8e\u6d45\u8584\uff0c\u9996\u5148\u60f3\u5230\u7684\u8fd8\u662f\u4f7f\u7528\u66b4\u529b\uff0c\u4f46\u6b64\u5904\u5982\u679c\u4f7f\u7528\u66b4\u529b\u5e94\u8be5\u4f1a\u5f88\u9ebb\u70e6\uff0c\u6240\u4ee5\u9009\u62e9\u9605\u8bfb\u9898\u89e3\uff0c\u770b\u5230\u4f7f\u7528\u4e00\u79cd\u5b57\u7b26\u4e32\u6392\u5e8f\u7684\u65b9\u5f0f\u89c9\u5f97\u5f88\u6709\u610f\u601d\uff0c\u5c06strs\u6570\u7ec4\u91cc\u7684\u5b57\u7b26\u4e32\u8fdb\u884c\u6392\u5e8f\u64cd\u4f5c\uff0c\u6700\u7ec8\u5f02\u4f4d\u8bcd\u4f1a\u4ee5\u76f8\u540c\u7684\u5f62\u5f0f\u5448\u73b0\uff0c\u6b64\u65f6\u53ea\u8981\u5c06\u5bf9\u5e94\u7684\u5f62\u5f0f\u8fdb\u884c\u5206\u7c7b\uff0c\u518d\u5c06\u6570\u7ec4\u91cc\u7684\u6570\u5b57\u586b\u5165\u5373\u53ef<\/p>\n\n\n\n
class Solution:\n    def groupAnagrams(self, strs: List[str]) -> List[List[str]]:\n        d = defaultdict(list)\n        for s in strs:\n            sorted_s = ''.join(sorted(s))\n            d[sorted_s].append(s)\n        return list(d.values())<\/code><\/pre>\n\n\n\n
3.\u6700\u957f\u8fde\u7eed\u5e8f\u5217\uff08128\uff09\"\"<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u521a\u770b\u5230\u8fd9\u9053\u9898\u6211\u7684\u60f3\u6cd5\u8fd8\u662f\u66b4\u529b\uff08\u6bd4\u8f83\u8822\uff09\uff0c\u540e\u6765\u770b\u9898\u89e3\u9009\u62e9\u4f7f\u7528\u4e86\u4e00\u79cd\u96c6\u5408\u7684\u601d\u60f3\uff0c\u5c06\u539f\u672c\u7684\u6570\u7ec4\u8f6c\u5316\u6210\u96c6\u5408\uff0c\u7136\u540e\u5bf9\u5176\u4e2d\u7684\u6bcf\u4e00\u4e2a\u6570\u5b57\u5224\u65ad\u96c6\u5408\u91cc\u662f\u5426\u6709\u6bd4\u4ed6\u5c0f1\u7684\u6570\u5b57\uff0c\u5982\u679c\u6709\u5c31\u53bb\u4e0b\u4e00\u4e2a\u6570\u5b57\uff0c\u5982\u679c\u6ca1\u6709\u5c31\u5224\u65ad\u662f\u5426\u6709\u6bd4\u4ed6\u59271\u7684\u6570\u5b57\uff0c\u5982\u679c\u5219\u957f\u5ea6\u52a0\u4e00<\/p>\n\n\n\n
\u96c6\u5408\u5224\u65ad<\/h2>\n\n\n\n
class Solution:\n    def longestConsecutive(self, nums: List[int]) -> int:\n        st = set(nums)\n        ans = 0\n        for x in st:\n            if x - 1 in st:\n                continue\n            y = x + 1\n            while y in st:\n                y += 1\n            ans = max(ans, y - x)\n        return ans<\/code><\/pre>\n\n\n\n
\u66b4\u529b\u7834\u89e3<\/h2>\n\n\n\n
\u9664\u4e86\u8fd9\u79cd\u505a\u6cd5\u4ee5\u5916\u5c31\u662f\u66b4\u529b\u4e86\uff0c\u5148\u5c06\u6570\u7ec4\u6392\u5e8f\uff0c\u7136\u540e\u4f9d\u6b21\u6bd4\u8f83\u540e\u4e00\u4f4d\u662f\u5426\u53ea\u6bd4\u524d\u4e00\u4f4d\u5927\u4e00<\/p>\n\n\n\n
class Solution:\n    def longestConsecutive(self, nums: List[int]) -> int:\n        nums.sort()\n        ans = 1\n        count = 1\n        if len(nums) == 0:\n            return 0\n        for i in range(len(nums) - 1):\n            if nums[i+1] - nums[i] == 1:\n                count += 1\n                ans = max(ans, count)\n            elif nums[i + 1] - nums[i] == 0:\n                continue\n            else:\n                count = 1\n        return ans<\/code><\/pre>\n\n\n\n
4.\u79fb\u52a8\u96f6\uff08283\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u9996\u5148\u6211\u60f3\u5230\u7684\u4f9d\u65e7\u662f\u66b4\u529b\uff0c\u904d\u5386\u6570\u7ec4\u7136\u540e\u51fa\u73b0\u96f6\u5c31\u628a\u6570\u5b57\u653e\u5230\u672b\u5c3e\uff0c\u628a\u540e\u4e00\u4f4d\u524d\u79fb\uff0c\u4f46\u5b9e\u9645\u4e0a\u770b\u4e86\u9898\u89e3\u4e4b\u540e\u53d1\u73b0\u4e86\u4e00\u4e2a\u66f4\u597d\u7684\u65b9\u5f0f\uff1a\u539f\u5730\u6808<\/p>\n\n\n\n
\u539f\u5730\u6808<\/h2>\n\n\n\n
\u5148\u8bbe\u7f6e\u6808\u5927\u5c0f\u4e3a0\uff0c\u7136\u540e\u5bf9\u6570\u7ec4\u6240\u6709\u5143\u7d20\u8fdb\u884c\u5224\u65ad\uff0c\u662f\u5426\u4e3a0\uff0c\u5982\u679c\u4e0d\u662f\uff0c\u5c31\u653e\u5165\u6808\u4e2d\uff0c\u7136\u540e\u6808\u6307\u9488\u540e\u79fb1\u4f4d\uff0c\u6700\u540e\u518d\u628a\u5269\u4f59\u90e8\u5206\u75280\u8865\u5168\uff0c\u975e\u5e38\u806a\u660e<\/p>\n\n\n\n
class Solution:\n    def moveZeroes(self, nums: List[int]) -> None:\n        \"\"\"\n        Do not return anything, modify nums in-place instead.\n        \"\"\"\n        stack_size = 0\n        for x in nums:\n            if x:\n                nums[stack_size] = x\n                stack_size += 1\n        for i in range(stack_size, len(nums)):\n            nums[i] = 0<\/code><\/pre>\n\n\n\n
\u5feb\u6162\u6307\u9488<\/h2>\n\n\n\n
\u53e6\u4e00\u79cd\u505a\u6cd5\u662f\u5feb\u6162\u53cc\u6307\u9488\uff0c\u7528fast\u6307\u9488\u53bb\u8dd1\uff0cslow\u6307\u9488\u7528\u6765\u66f4\u65b0\u5143\u7d20\uff0cslow\u521d\u59cb\u4e3a\u96f6\uff0c\u5982\u679cfast\u78b0\u5230\u7684\u5143\u7d20\u975e0\uff0c\u5219\u5c06slow\u7684\u4f4d\u7f6e\u66f4\u65b0\u6210fast\u7684\u5143\u7d20\uff0c\u7136\u540eslow\u6307\u9488\u540e\u79fb\u4e00\u4f4d\uff0c\u540c\u65f6\u628afast\u66f4\u65b0\u6210slow\u66f4\u65b0\u524d\u7684\u5143\u7d20<\/p>\n\n\n\n
class Solution:\n    def moveZeroes(self, nums: List[int]) -> None:\n        \"\"\"\n        Do not return anything, modify nums in-place instead.\n        \"\"\"\n        slow = 0\n        for fast in range(len(nums)):\n            if nums[fast]:\n                temp = nums[slow]\n                nums[slow] = nums[fast]\n                nums[fast] = temp\n                slow += 1<\/code><\/pre>\n\n\n\n
5.\u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668\uff0811\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u5173\u4e8e\u8fd9\u9053\u9898\u6211\u7684\u601d\u8def\u6bd4\u8f83\u7b80\u5355\uff0c\u7531\u4e8e\u5bb9\u7eb3\u6c34\u91cf\u7684\u6700\u5927\u503c\u6709\u6728\u6876\u6548\u5e94\uff0c\u6240\u4ee5\u6b64\u65f6\u6211\u4eec\u53ea\u9700\u8981\u8003\u8651\u4e24\u5757\u677f\u5b50\u4e2d\u6700\u5c0f\u7684\u4e00\u5757\uff0c\u7136\u540e\u4ee5\u5b83\u7684\u9ad8\u5ea6\u4e58\u4ee5\u4e24\u5757\u677f\u5b50\u7684\u95f4\u8ddd\uff0c\u4e4b\u540e\u628a\u9009\u62e9\u4e24\u5757\u677f\u5b50\u4e2d\u8f83\u77ed\u4e00\u5757\u7684\u677f\u5b50\u66ff\u6362\uff0c\u540c\u65f6\u7528ans\u65f6\u523b\u66f4\u65b0\u6700\u5927\u503c\u5c31\u53ef\u4ee5<\/p>\n\n\n\n
class Solution:\n    def maxArea(self, height: List[int]) -> int:\n        left = 0\n        right = len(height) - 1\n        ans = 0\n        while left < right:\n            ans = max(ans, min(height[left],height[right]) * (right - left))\n            if height[right] < height[left]:\n                right -= 1\n            else:\n                left += 1\n        return ans<\/code><\/pre>\n\n\n\n
6.\u4e09\u6570\u4e4b\u548c\uff0815\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u9053\u9898\u7684\u601d\u8def\u4f9d\u7136\u662f\u5b66\u4e60\u6765\u7684\uff0c\u5b66\u4e86\u4e00\u79cd\u76f8\u5411\u53cc\u6307\u9488\u7684\u601d\u8def\uff0c\u8fd9\u9053\u9898\u770b\u4f3c\u662f\u4e09\u4e2a\u6570\u5b57\u4e4b\u548c\u4e3a0\uff0c\u4f46\u5b9e\u9645\u4e0a\u6211\u4eec\u53ef\u4ee5\u62c6\u89e3\u6210\uff1a\u5047\u5982\u8bf4\u7b2c\u4e00\u4e2a\u6570\u5b57\u5df2\u7ecf\u786e\u5b9a\u4e86\uff0c\u90a3\u4e48\u6211\u4eec\u5c31\u53bb\u63a7\u5236\u540e\u9762\u4e24\u4e2a\u6570\u5b57\uff0c\u7531\u4e8e\u6392\u5e8f\u540e\u7684\u6570\u5b57\u662f\u6709\u5e8f\u7684\uff0c\u6211\u4eec\u53ef\u4ee5\u6839\u636e\u4e09\u8005\u4e4b\u548cs\u8fdb\u884c\u5224\u65ad\uff1a<\/p>\n\n\n\n
\u5982\u679c\u5927\u4e8e0\uff0c\u90a3\u4e48\u7b2c\u4e09\u4e2a\u6570\u5b57\u8fc7\u5927\uff0c\u6211\u4eec\u5411\u524d\u79fb\u4e00\u4f4d<\/p>\n\n\n\n
\u5982\u679c\u5c0f\u4e8e0\uff0c\u5219\u7b2c\u4e8c\u4e2a\u6570\u5b57\u8fc7\u5c0f\uff0c\u5f80\u540e\u79fb\u4e00\u4f4d<\/p>\n\n\n\n
\u4e4b\u540e\uff0c\u6211\u4eec\u8981\u8003\u8651\u4e0d\u8981\u51fa\u73b0\u91cd\u590d\u7684\u60c5\u51b5\uff0c\u6240\u4ee5\u5224\u65ad\u5982\u679c\u4e24\u4e2a\u6307\u9488\u524d\u540e\u5bf9\u5e94\u7684\u6570\u5b57\u76f8\u540c\uff0c\u5c31continue\u7ee7\u7eed\u627e\u4e00\u4f4d\u3002<\/p>\n\n\n\n
class Solution:\n    def threeSum(self, nums: List[int]) -> List[List[int]]:\n        nums.sort()\n        ans = []\n        n = len(nums)\n        for i in range(n - 2):\n            x = nums[i]\n            if i > 0 and x == nums[i - 1]:\n                continue\n            if x + nums[i + 1] + nums[i + 2] > 0:\n                break\n            if x + nums[n-1] + nums[n - 2] < 0:\n                continue\n            j = i + 1\n            k = n - 1\n            while j < k:\n                s = x + nums[j] + nums[k]\n                if s > 0:\n                    k -= 1\n                elif s < 0:\n                    j += 1\n                else:\n                    ans.append([x, nums[j], nums[k]])\n                    j += 1\n                    while j < k and nums[j] == nums[j - 1]:\n                        j += 1\n                    k -= 1\n                    while j < k and nums[k] == nums[k + 1]:\n                        k -= 1\n        return ans<\/code><\/pre>\n\n\n\n
7.\u63a5\u96e8\u6c34\uff0842\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u9053\u9898\u4e24\u4e2a\u6708\u524d\u505a\u8fc7\uff0c\u4eca\u5929\u53c8\u505a\uff0c\u9664\u4e86\u53cc\u6307\u9488\u8111\u5b50\u91cc\u4e00\u70b9\u4e1c\u897f\u6ca1\u6709\uff0c\u5173\u952e\u53cc\u6307\u9488\u8fd8\u6ca1\u5f04\u51fa\u6765\uff0c\u6700\u7ec8\u53c8\u770b\u4e86\u4e00\u904d\u89c6\u9891\uff0c\u6b64\u523b\u60f3\u5230\u4e24\u79cd\u505a\u6cd5<\/p>\n\n\n\n
\u524d\u7f00\u540e\u7f00\u548c<\/h2>\n\n\n\n
\u9996\u5148\u4ece\u5934\u5f80\u540e\u4e00\u6b21\u8bb0\u5f55\u5f53\u524d\u4f4d\u7f6e\u4e4b\u524d\u6216\u8005\u4e4b\u540e\u6700\u9ad8\u7684\u4f4d\u7f6e\uff0c\u653e\u5165\u6570\u7ec4\u4e2d\u8fdb\u884c\u8bb0\u5f55\uff0c\u6700\u7ec8\u5728\u6c42\u5f53\u524d\u4f4d\u7f6e\u53ef\u76db\u6c34\u9ad8\u5ea6\u65f6\uff0c\u53ea\u9700\u5c06\u524d\u9762\u6700\u9ad8\u548c\u540e\u9762\u6700\u9ad8\u4e2d\u7684\u8f83\u4f4e\u8005\uff0c\u51cf\u53bb\u5f53\u524d\u4f4d\u7f6e\u7684\u9ad8\u5ea6\u5c31\u53ef\u4ee5\u5f97\u51fa<\/p>\n\n\n\n
class Solution:\n    def trap(self, height: List[int]) -> int:\n        n = len(height)\n        pre_max = [0] * n\n        pre_max[0] = height[0]\n        for i in range(1, n):\n            pre_max[i] = max(pre_max[i - 1], height[i])\n\n        suf_max = [0] * n\n        suf_max[-1] = height[-1]\n        for j in range(n - 2, -1, -1):\n            suf_max[j] = max(suf_max[j + 1], height[j])\n\n        ans = 0\n        for h, pre, suf in zip(height, pre_max, suf_max):\n            ans += min(pre, suf) - h\n        return ans<\/code><\/pre>\n\n\n\n
\u76f8\u5411\u53cc\u6307\u9488<\/h2>\n\n\n\n
\u601d\u8def\u548c\u4e0a\u4e00\u9898\u5927\u81f4\u76f8\u540c\uff0c\u53ea\u4e0d\u8fc7\u6b64\u65f6\u6211\u4eec\u4f7f\u7528\u76f8\u5411\u53cc\u6307\u9488\u8bb0\u5f55\u5de6\u8fb9\u548c\u53f3\u8fb9\u7684\u6700\u5927\u503c<\/p>\n\n\n\n
class Solution:\n    def trap(self, height: List[int]) -> int:\n        n = len(height)\n        ans = 0\n        pre_max = 0\n        suf_max = 0\n        left = 0\n        right = len(height) - 1\n        while left < right:\n            pre_max = max(pre_max, height[left])\n            suf_max = max(suf_max, height[right])\n            if pre_max < suf_max:\n                ans += pre_max - height[left]\n                left += 1\n            else:\n                ans += suf_max - height[right]\n                right -= 1\n        return ans<\/code><\/pre>\n\n\n\n
8.\u65e0\u91cd\u590d\u5b57\u7b26\u7684\u6700\u957f\u5b57\u4e32\uff083\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u91cc\u9700\u8981\u6ce8\u610f\u4e00\u4e0b\uff0cPython\u4e2d\u6709\u4e00\u4e2aCounter()\u6570\u7ec4\uff0c\u81ea\u52a8\u8bb0\u5f55\u6570\u7ec4\u4e2d\u5bf9\u5e94\u952e\u7684\u51fa\u73b0\u6b21\u6570\uff0c\u8fd9\u9053\u9898\u6211\u4eec\u53ef\u4ee5\u4f7f\u7528\u8fd9\u4e2a\u6570\u7ec4\u4ee5\u54c8\u5e0c\u7684\u65b9\u5f0f\u6765\u4ece\u524d\u5411\u540e\u8bb0\u5f55\u6bcf\u4e2a\u5b57\u7b26\u51fa\u73b0\u7684\u6b21\u6570\uff0c\u5982\u679c\u51fa\u73b0\u6b21\u6570\u5927\u4e8e\u4e00\u5c31\u5c06\u505a\u6307\u9488\u5411\u540e\u79fb\u4e00\u4e2a\uff0c\u6b64\u5904\u6709\u4f7f\u7528\u5230\u6ed1\u52a8\u7a97\u53e3\u7684\u601d\u60f3<\/p>\n\n\n\n
class Solution:\n    def lengthOfLongestSubstring(self, s: str) -> int:\n        cnt = Counter()\n        ans = 0\n        left = 0\n        if len(s) == 0:\n            return 0\n        for right, c in enumerate(s):\n            cnt[c] += 1\n            while cnt[c] > 1:\n                cnt[s[left]] -= 1\n                left += 1\n            ans = max(ans, right - left + 1)\n        return ans<\/code><\/pre>\n\n\n\n
9.\u627e\u5230\u5b57\u7b26\u4e32\u4e2d\u6240\u6709\u5b57\u6bcd\u5f02\u4f4d\u8bcd\uff08438\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u9053\u9898\u8fd0\u7528\u5230\u7684\u601d\u60f3\u548c\u4e0a\u4e00\u9898\u4e5f\u5f88\u7c7b\u4f3c\uff0c\u54c8\u5e0c\u5b58\u50a8\u51fa\u73b0\u6b21\u6570+\u6ed1\u52a8\u7a97\u53e3\u3002\u6211\u4eec\u9996\u5148\u5b9a\u4e49\u4e00\u4e2acnt_p\u6765\u8bb0\u5f55\u76ee\u6807p\u5b57\u7b26\u4e32\u5404\u4e2a\u5b57\u7b26\u7684\u51fa\u73b0\u6b21\u6570\u4f5c\u4e3a\u6807\u51c6\uff0c\u518d\u5b9a\u4e49cnt_s\u6765\u8bb0\u5f55\u88ab\u67e5\u5b57\u7b26\u4e32s\u7684\u5404\u4e2a\u5b57\u7b26\u7684\u51fa\u73b0\u6b21\u6570\u3002<\/p>\n\n\n\n
\u4f7f\u7528\u6ed1\u52a8\u7a97\u53e3\uff0c\u6328\u4e2a\u5b57\u7b26\u5411\u5185\u52a0\u5165\uff0c\u5e76\u65f6\u523b\u66f4\u65b0left\u6307\u9488\u4f4d\u7f6e\uff0c\u4fdd\u8bc1\u6821\u9a8c\u957f\u5ea6\u6b63\u5e38\uff0c\u7136\u540e\u65f6\u523b\u5224\u65adcnt_s \u548ccnt_p \u662f\u5426\u4e00\u81f4\uff0c\u82e5\u4e00\u81f4\u5219\u5c06left\u6307\u9488\u4f4d\u7f6e\u586b\u5165ans \u6570\u7ec4\u5f53\u4e2d<\/p>\n\n\n\n
class Solution:\n    def findAnagrams(self, s: str, p: str) -> List[int]:\n        ans = []\n        cnt_p = Counter(p)\n        cnt_s = Counter()\n        right = 0\n        for right, c in enumerate(s):\n            cnt_s[c] += 1\n            left = right - len(p) + 1\n            if left < 0:\n                continue\n            if cnt_s == cnt_p:\n                ans.append(left)\n            out = s[left]\n            cnt_s[out] -= 1\n            if cnt_s[out] == 0:\n                del cnt_s[out]\n        return ans            <\/code><\/pre>\n\n\n\n
10.\u548c\u4e3aK \u7684\u5b50\u6570\u7ec4\uff08560\uff09\"\"<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u9053\u9898\u4f7f\u7528\u524d\u7f00\u548c\u6c42\u89e3\uff0c\u9996\u5148\u5b9a\u4e49\u4e00\u4e2as\u6570\u7ec4\u957f\u5ea6\u4e3anums\u52a0\u4e00\uff0c\u7136\u540e\u5c06\u6570\u7ec4\u7b2c\u4e00\u4f4d\u7f6e0\uff0c\u540e\u7eed\u7684\u5168\u90e8\u7528\u524d\u7f00\u548c\u586b\u5165\uff0c\u518d\u5b9a\u4e49\u4e00\u4e2a cnt \u7528\u6765\u8bb0\u5f55 s \u6570\u7ec4\u91cc\u6bcf\u4e2a\u524d\u7f00\u548c\u7684\u51fa\u73b0\u6570\u91cf\uff0c\u6211\u4eec\u53ef\u4ee5\u5f97\u77e5\uff0csj – k \u7684\u6570\u503c\u5c31\u662f\u6211\u4eec\u6240\u9700\u8981\u7684\u524d\u7f00\u548c\u7684\u5927\u5c0f\uff0c\u7136\u540e\u4f7f\u7528 ans \u6765\u8bb0\u5f55\u8fd9\u4e2a\u503c\u51fa\u73b0\u7684\u6b21\u6570\uff0c\u90a3\u4e48\u6211\u4eec\u5c31\u53ef\u4ee5\u7b97\u51fa\u6709\u591a\u5c11\u5b50\u6570\u7ec4\u6ee1\u8db3\u6761\u4ef6<\/p>\n\n\n\n
class Solution:\n    def subarraySum(self, nums: List[int], k: int) -> int:\n        s = [0] * (len(nums) + 1)\n        for i, x in enumerate(nums):\n            s[i + 1] = s[i] + x\n\n        cnt = defaultdict(int)\n        ans = 0\n        for sj in s:\n            ans += cnt[sj - k]\n            cnt[sj] += 1\n        return ans<\/code><\/pre>\n\n\n\n
11.\u6ed1\u52a8\u7a97\u53e3\u6700\u5927\u503c\uff08239\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u521a\u770b\u5230\u8fd9\u9053\u9898\u6211\u7684\u60f3\u6cd5\u6bd4\u8f83\u56fa\u5b9a\uff0c\u8fd8\u662f\u7528\u6ed1\u52a8\u7a97\u53e3\u7684\u601d\u60f3\u6765\u627e\u51fa\u5bf9\u5e94\u7684\u6700\u5927\u503c\uff0c\u5148\u627e\u5230\u6211\u9700\u8981\u64cd\u4f5c\u7684\u7a97\u53e3\u7136\u540e\u5728\u7a97\u53e3\u91cc\u627e\u5230\u6700\u5927\u503c\uff0c\u4f46\u5b9e\u9645\u4e0a\u8fd9\u6837\u64cd\u4f5c\u8d77\u6765\u76f8\u5bf9\u6bd4\u8f83\u9ebb\u70e6\u3002<\/p>\n\n\n\n
\u66f4\u806a\u660e\u7684\u505a\u6cd5\u662f\u7528\u4e00\u4e2a\u53cc\u7aef\u961f\u5217\u5b9e\u73b0\uff0c\u6bcf\u6b21\u5bf9\u65b0\u52a0\u5165\u7684\u6570\u636e\u8fdb\u884c\u5224\u65ad\uff0c\u5224\u65ad\u5b83\u662f\u5426\u6bd4\u76ee\u524d\u7a97\u53e3\u5185\u7684\u6700\u5927\u6570\u636e\u5927\uff0c\u5982\u679c\u66f4\u5927\u5c31\u628a\u65e7\u6570\u636e\u5f39\u51fa\uff0c\u52a0\u5165\u65b0\u6570\u636e\u7684\u4e0b\u6807\uff0c\u6709\u65b0\u6570\u636e\u52a0\u5165\u90a3\u4e48\u6ed1\u52a8\u7a97\u53e3\u91cc\u6700\u5de6\u7aef\u7684\u6570\u636e\u5c31\u9700\u8981\u5f39\u51fa\uff0c\u90a3\u4e48\u6211\u4eec\u53ef\u4ee5\u4f7f\u7528left = i – k + 1 \u6765\u8bb0\u5f55\u5de6\u7aef\u70b9\u7684\u4f4d\u7f6e\uff0c\u5982\u679c\u7a97\u53e3\u76ee\u524d\u6700\u5927\u503c\u7684\u4f4d\u7f6e\u5c0f\u4e8e left\uff0c\u90a3\u4e48\u5c06\u5de6\u7aef\u70b9\u5f39\u51fa\uff0c\u987a\u4fbf\u8bb0\u5f55\u4e0b\u5bf9\u5e94\u7684 ans \u503c<\/p>\n\n\n\n
class Solution:\n    def maxSlidingWindow(self, nums: List[int], k: int) -> List[int]:\n        ans = [0] * (len(nums) - k + 1)  # \u7a97\u53e3\u4e2a\u6570\n        q = deque()  # \u53cc\u7aef\u961f\u5217\n\n        for i, x in enumerate(nums):\n            # 1. \u53f3\u8fb9\u5165\n            while q and nums[q[-1]] <= x:\n                q.pop()  # \u7ef4\u62a4 q \u7684\u5355\u8c03\u6027\n            q.append(i)  # \u6ce8\u610f\u4fdd\u5b58\u7684\u662f\u4e0b\u6807\uff0c\u8fd9\u6837\u4e0b\u9762\u53ef\u4ee5\u5224\u65ad\u961f\u9996\u662f\u5426\u79bb\u5f00\u7a97\u53e3\n\n            # 2. \u5de6\u8fb9\u51fa\n            left = i - k + 1  # \u7a97\u53e3\u5de6\u7aef\u70b9\n            if q[0] < left:  # \u961f\u9996\u79bb\u5f00\u7a97\u53e3\n                q.popleft()\n\n            # 3. \u5728\u7a97\u53e3\u5de6\u7aef\u70b9\u5904\u8bb0\u5f55\u7b54\u6848\n            if left >= 0:\n                # \u7531\u4e8e\u961f\u9996\u5230\u961f\u5c3e\u5355\u8c03\u9012\u51cf\uff0c\u6240\u4ee5\u7a97\u53e3\u6700\u5927\u503c\u5c31\u5728\u961f\u9996\n                ans[left] = nums[q[0]]\n\n        return ans<\/code><\/pre>\n\n\n\n
12.\u6700\u5c0f\u8986\u76d6\u5b50\u4e32\uff0876\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u9053\u9898\u7684\u601d\u60f3\u4e3b\u8981\u662f\u7528\u6ed1\u52a8\u7a97\u53e3\u914d\u5408\u54c8\u5e0c\u8868\u6765\u8bb0\u5f55\u5bf9\u5e94\u5b57\u7b26\u7684\u51fa\u73b0\u6b21\u6570\uff0c\u90a3\u4e48\u6211\u4eec\u53ea\u8981\u4fbf\u4f7f\u7528\u6ed1\u52a8\u7a97\u53e3\uff0c\u8fb9\u4f7f\u7528\u54c8\u5e0c\u8868\u8fdb\u884c\u8bb0\u5f55\uff0c\u5982\u679ccnt_s\u7684\u503c\u4e0ecnt_t\u7684\u503c\u76f8\u7b49\uff0c\u90a3\u4e48\u8bf4\u660e\u6211\u4eec\u76ee\u524d\u5df2\u7ecf\u627e\u5230\u4e86\u8986\u76d6\u5b50\u4e32\uff0c\u540c\u65f6\u6211\u4eec\u518d\u5b9a\u4e49\u5bf9\u5e94\u7684left\u3001right\u548cans_left\u3001ans_right\u6765\u8bb0\u5f55\u627e\u51fa\u6700\u5c0f\u7684\u8986\u76d6\u5b50\u4e32\uff0c\u6700\u540e\u8f93\u51fa\u7684\u65f6\u5019\u53ea\u8981\u8f93\u51fas[ans_left:ans_right + 1]\u5207\u7247\u5373\u53ef<\/p>\n\n\n\n
class Solution:\n    def minWindow(self, s: str, t: str) -> str:\n        cnt_t = Counter(t)\n        cnt_s = Counter()\n\n        ans_left = -1\n        ans_right = len(s)\n        left = 0\n        for right, x in enumerate(s):\n            cnt_s[x] += 1\n            while cnt_s >= cnt_t:\n                if right - left < ans_right - ans_left:\n                    ans_left, ans_right = left, right\n                cnt_s[s[left]] -= 1\n                left += 1\n        return \"\" if ans_left < 0 else s[ans_left: ans_right + 1]<\/code><\/pre>\n\n\n\n
13.\u6700\u5927\u5b50\u6570\u7ec4\u548c\uff0853\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u9053\u9898\u518d\u6b21\u8fd0\u7528\u5230\u524d\u7f00\u548c\u7684\u601d\u60f3\uff0c\u6211\u4eec\u5148\u5bf9\u6570\u7ec4\u6c42\u51fa\u524d\u7f00\u548c\u6570\u7ec4\uff0c\u7136\u540e\u5bf9\u524d\u7f00\u548c\u6570\u7ec4\u8fdb\u884c\u904d\u5386\uff0c\u5982\u679c\u6211\u4eec\u60f3\u8981\u627e\u5230\u6700\u5927\u7684\u8fde\u7eed\u5b50\u6570\u7ec4\uff0c\u90a3\u4e48\u6211\u4eec\u8981\u505a\u7684\u53ea\u662f\u6c42\u51fa\u5f53\u524d\u4f4d\u7f6e\u7684\u524d\u7f00\u548c\uff0c\u51cf\u53bb\u4e4b\u524d\u4f4d\u7f6e\u524d\u7f00\u7684\u6700\u5c0f\u503c\uff0c\u4e2d\u95f4\u7684\u5143\u7d20\u5c31\u6784\u6210\u4e86\u6700\u5927\u548c\u7684\u8fde\u7eed\u5b57\u6570\u7ec4\uff0c\u6700\u7ec8\u7528 ans \u8fdb\u884c\u6700\u5927\u503c\u7684\u8bb0\u5f55\u5e76\u8f93\u51fa<\/p>\n\n\n\n
class Solution:\n    def maxSubArray(self, nums: List[int]) -> int:\n        ans = -inf\n        min_pre_sum = pre_sum = 0\n        for x in nums:\n            pre_sum += x\n            ans = max(ans, pre_sum - min_pre_sum)\n            min_pre_sum = min(min_pre_sum, pre_sum)\n        return ans<\/code><\/pre>\n\n\n\n
14.\u5408\u5e76\u6570\u7ec4\uff0856\uff09<\/h1>\n\n\n\n
\"\"<\/div><\/figure>\n\n\n\n
\u8fd9\u9053\u9898\u7684\u601d\u8def\u662f\u7b2c\u4e00\u6b65\u5148\u628a\u7ed9\u51fa\u7684\u6570\u7ec4\u6392\u5e8f\uff0c\u8fd9\u91cc\u4f7f\u7528\u5230sort \u51fd\u6570\u7684\u4e00\u4e2a\u7279\u6b8a\u7528\u6cd5\uff1asort(key=lambda x:x[0])\uff0c\u610f\u601d\u5c31\u662f\u8bf4\u6392\u5e8f\u7684\u4f9d\u636e\u662f\u6bcf\u4e2a\u5b50\u6570\u7ec4\u5143\u7d20\u4e2d\u7684\u7b2c\u4e00\u4e2a\u5143\u7d20\u5927\u5c0f\uff0c\u5982\u679c\u662f\u8fd9\u4e48\u6392\u5e8f\u5c31\u53ef\u4ee5\u4f7f\u5f97\u540e\u9762\u7684\u64cd\u4f5c\u65b9\u4fbf\u5f88\u591a\u3002
\u6392\u5e8f\u4e4b\u540e\uff0c\u89e3\u9898\u601d\u8def\u4e3b\u8981\u662f\u5bf9\u6570\u7ec4\u5143\u7d20\u8fdb\u884c\u904d\u5386\uff0c\u7136\u540e\u5224\u65ad\u5982\u679c\u524d\u4e00\u4e2a\u533a\u95f4\u7684\u95ed\u5408\u4f4d\u7f6e\u5927\u4e8e\u76ee\u524d\u533a\u95f4\u7684\u8d77\u59cb\u4f4d\u7f6e\uff0c\u90a3\u4e48\u5c31\u628a\u524d\u4e00\u4e2a\u533a\u95f4\u7684\u8d77\u59cb\u4f4d\u7f6e\u548c\u76ee\u524d\u533a\u95f4\u7684\u95ed\u5408\u4f4d\u7f6e\u7ec4\u6210\u4e00\u4e2a\u533a\u95f4\uff0c\u4e5f\u5c31\u662f\u5c06\u6570\u7ec4\u8fdb\u884c\u5408\u5e76\uff0c\u7136\u540e\u7ee7\u7eed\u5411\u540e\u5224\u65ad\uff0c\u5982\u679c\u4e0d\u6ee1\u8db3\u8fd9\u79cd\u60c5\u51b5\uff0c\u8bf4\u660e\u51fa\u73b0\u65ad\u70b9\u65e0\u6cd5\u5408\u5e76\uff0c\u5c31\u63a8\u8fdb ans \u91cc\u9762\u8fdb\u884c\u8bb0\u5f55<\/p>\n\n\n\n
class Solution:\n    def merge(self, intervals: List[List[int]]) -> List[List[int]]:\n        if not intervals:\n            return []\n\n        intervals.sort(key=lambda x: x[0])\n\n        ans = []\n        start, end = intervals[0]\n\n        for i in range(1, len(intervals)):\n            current_start, current_end = intervals[i]\n\n            if current_start <= end:\n                end = max(end, current_end)  \n            else:\n                ans.append([start, end])\n                start, end = current_start, current_end\n\n        ans.append([start, end])\n\n        return ans<\/code><\/pre>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
1.\u4e24\u6570\u4e4b\u548c\uff081\uff09 \u66b4\u529b\u7834\u89e3 \u6211\u9996\u5148\u60f3\u5230\u7684\u662f\u66b4\u529b\u7834\u89e3\uff0c\u4f7f\u7528\u53cc\u5faa\u73af\uff0c\u4f46\u8fd9\u79cd\u65b9\u6cd5\u65f6\u95f4\u590d\u6742\u5ea6\u592a\u9ad8\uff0c\u597d\u5728\u5bb9\u6613\u60f3\u5230 \u54c8\u5e0c […]<\/p>\n","protected":false},"author":1,"featured_media":323,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11,5],"tags":[14],"class_list":["post-307","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-python","category-5","tag-14"],"_links":{"self":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/307","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/comments?post=307"}],"version-history":[{"count":2,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/307\/revisions"}],"predecessor-version":[{"id":324,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/posts\/307\/revisions\/324"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/media\/323"}],"wp:attachment":[{"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/media?parent=307"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/categories?post=307"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jdoxk3.cn\/index.php\/wp-json\/wp\/v2\/tags?post=307"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}