\u4f8b2.1.1\u53cd\u8f6c\u5b57\u7b26\u6570\u7ec4<\/a><\/h3>\n\n\n\n\u7f16\u5199\u4e00\u4e2a\u51fd\u6570\uff0c\u5176\u4f5c\u7528\u662f\u5c06\u8f93\u5165\u7684\u5b57\u7b26\u4e32\u53cd\u8f6c\u8fc7\u6765\u3002\u8f93\u5165\u5b57\u7b26\u4e32\u4ee5\u5b57\u7b26\u6570\u7ec4 s<\/code> \u7684\u5f62\u5f0f\u7ed9\u51fa\u3002<\/p>\n\n\n\n\u4e0d\u8981\u7ed9\u53e6\u5916\u7684\u6570\u7ec4\u5206\u914d\u989d\u5916\u7684\u7a7a\u95f4\uff0c\u4f60\u5fc5\u987b\u539f\u5730\u4fee\u6539\u8f93\u5165\u6570\u7ec4\u3001\u4f7f\u7528 O(1) \u7684\u989d\u5916\u7a7a\u95f4\u89e3\u51b3\u8fd9\u4e00\u95ee\u9898\u3002<\/p>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>s = [\"h\",\"e\",\"l\",\"l\",\"o\"]\n\u8f93\u51fa\uff1a<\/strong>[\"o\",\"l\",\"l\",\"e\",\"h\"]\n<\/pre>\n\n\n\n\u793a\u4f8b 2\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>s = [\"H\",\"a\",\"n\",\"n\",\"a\",\"h\"]
\u8f93\u51fa\uff1a<\/strong>[\"h\",\"a\",\"n\",\"n\",\"a\",\"H\"]<\/pre>\n\n\n\n\u4ee3\u7801\u5982\u4e0b\uff0c\u53ef\u4ee5\u770b\u5230\u975e\u5e38\u7b80\u5355\uff0c\u8bbe\u7f6e\u4e00\u4e2a\u5934\u6307\u9488\u4e00\u4e2a\u5c3e\u6307\u9488\u5373\u53ef\u3002<\/p>\n\n\n\n
class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n head=0\n tail=len(s)-1\n while head<tail:\n s[head],s[tail]=s[tail],s[head]\n head+=1\n tail-=1\n\n<\/code><\/pre>\n\n\n\n\u4f8b2.1.2\u5782\u76f4\u7ffb\u8f6c\u5b50\u77e9\u9635<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a m x n \u7684\u6574\u6570\u77e9\u9635 grid\uff0c\u4ee5\u53ca\u4e09\u4e2a\u6574\u6570 x<\/code>\u3001y<\/code> \u548c k<\/code>\u3002<\/p>\n\n\n\n\u6574\u6570 x<\/code> \u548c y<\/code> \u8868\u793a\u4e00\u4e2a \u6b63\u65b9\u5f62\u5b50\u77e9\u9635 \u7684\u5de6\u4e0a\u89d2\u4e0b\u6807\uff0c\u6574\u6570 k \u8868\u793a\u8be5\u6b63\u65b9\u5f62\u5b50\u77e9\u9635\u7684\u8fb9\u957f\u3002<\/p>\n\n\n\n\u4f60\u7684\u4efb\u52a1\u662f\u5782\u76f4\u7ffb\u8f6c\u5b50\u77e9\u9635\u7684\u884c\u987a\u5e8f\u3002<\/p>\n\n\n\n
\u8fd4\u56de\u66f4\u65b0\u540e\u7684\u77e9\u9635\u3002<\/p>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n![\"\"\/](\"data:image\/svg+xml;base64,PCEtLUFyZ29uTG9hZGluZy0tPgo8c3ZnIHdpZHRoPSIxIiBoZWlnaHQ9IjEiIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyIgc3Ryb2tlPSIjZmZmZmZmMDAiPjxnPjwvZz4KPC9zdmc+\")
<\/div><\/figure>\n\n\n\n\u8f93\u5165\uff1a<\/strong> grid = [[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]], x = 1, y = 0, k = 3<\/p>\n\n\n\n\u8f93\u51fa\uff1a<\/strong> [[1,2,3,4],[13,14,15,8],[9,10,11,12],[5,6,7,16]]<\/p>\n\n\n\n\u6b64\u9898\u5176\u5b9e\u4e0e\u53cd\u8f6c\u5b57\u7b26\u4e32\u6ca1\u4ec0\u4e48\u533a\u522b\uff0c\u53ea\u662f\u5c06\u5934\u5c3e\u6307\u9488\u6362\u6210\u4e86\u4e0a\u4e0b\u6307\u9488\u9010\u4e00\u4ea4\u6362\u884c\u5143\u7d20\u5373\u53ef\u3002\u540c\u65f6\u6d89\u53ca\u5230\u6279\u91cf\u4ea4\u6362\u5143\u7d20\uff0c\u53ef\u4ee5\u76f4\u63a5\u4f7f\u7528python\u5217\u8868\u91cc\u7684\u5207\u7247\u8d4b\u503c\u6765\u8fdb\u884c\u6279\u91cf\u53cd\u8f6c\uff0c\u8fd9\u6837\u53ef\u4ee5\u4f7f\u5f97\u4ee3\u7801\u975e\u5e38\u7b80\u6d01\u4e14\u6613\u61c2\u3002<\/strong><\/p>\n\n\n\nclass Solution:\n def reverseSubmatrix(self, grid: List[List[int]], x: int, y: int, k: int) -> List[List[int]]:\n head=x\n tail=x+k-1\n while head<tail:\n grid[head][y:y+k],grid[tail][y:y+k]=grid[tail][y:y+k],grid[head][y:y+k]\n head+=1\n tail-=1\n return grid\n\n<\/code><\/pre>\n\n\n\n\u4f8b2.1.3\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u5143\u97f3\u5b57\u6bcd<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u5b57\u7b26\u4e32 s<\/code> \uff0c\u4ec5\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u5143\u97f3\u5b57\u6bcd\uff0c\u5e76\u8fd4\u56de\u7ed3\u679c\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n\u5143\u97f3\u5b57\u6bcd\u5305\u62ec 'a'<\/code>\u3001'e'<\/code>\u3001'i'<\/code>\u3001'o'<\/code>\u3001'u'<\/code>\uff0c\u4e14\u53ef\u80fd\u4ee5\u5927\u5c0f\u5199\u4e24\u79cd\u5f62\u5f0f\u51fa\u73b0\u4e0d\u6b62\u4e00\u6b21\u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>s = “IceCreAm”<\/p>\n\n\n\n\u8f93\u51fa\uff1a<\/strong>“AceCreIm”<\/p>\n\n\n\n\u89e3\u91ca\uff1a<\/strong><\/p>\n\n\n\ns<\/code> \u4e2d\u7684\u5143\u97f3\u662f ['I', 'e', 'e', 'A']<\/code>\u3002\u53cd\u8f6c\u8fd9\u4e9b\u5143\u97f3\uff0cs<\/code> \u53d8\u4e3a “AceCreIm”.<\/p>\n\n\n\n\u6ce8\u610f\uff0c\u5728python\uff0cjava\u4e2d\u5b57\u7b26\u4e32\u5c5e\u4e8e\u4e0d\u53ef\u53d8\u91cf\uff0c\u4e0d\u53ef\u4ee5\u76f4\u63a5\u50cf\u6570\u7ec4\u4e00\u6837\u9996\u5c3e\u4ea4\u6362\uff0c\u9700\u8981\u5148\u8f6c\u6362\u4e3a\u6570\u7ec4\u7136\u540e\u518d\u8fdb\u884c\u64cd\u4f5c<\/strong>\u3002<\/p>\n\n\n\n\u5199\u6cd5\u4e00\uff1a\u5faa\u73af\u5d4c\u5957<\/p>\n\n\n\n
class Solution:\n def reverseVowels(self, s: str) -> str:\n head=0\n tail=len(s)-1\n temp=list(s)\n while head<tail:\n while head<len(s) and temp[head] not in 'aeiouAEIOU':\n head+=1\n while tail>=0 and s[tail] not in 'aeiouAEIOU':\n tail-=1\n if head>=tail:\n break\n temp[head],temp[tail]=temp[tail],temp[head]\n head+=1\n tail-=1\n return \"\".join(temp)<\/code><\/pre>\n\n\n\n\u5199\u6cd5\u4e8c\uff1aif-else\u5224\u65ad<\/p>\n\n\n\n
class Solution:\n def reverseVowels(self, s: str) -> str:\n head=0\n tail=len(s)-1\n temp=list(s)\n while head<tail:\n if s[head] not in 'aeiouAEIOU':\n head+=1\n elif s[tail] not in 'aeiouAEIOU':\n tail-=1\n else:\n temp[head],temp[tail]=temp[tail],temp[head]\n head+=1\n tail-=1\n return \"\".join(temp)\n<\/code><\/pre>\n\n\n\n\u4e0a\u8ff0\u4e24\u79cd\u5199\u6cd5\u90fd\u6bd4\u8f83\u76f4\u89c2\uff0c\u6027\u80fd\u4e5f\u51e0\u4e4e\u4e00\u76f4\uff0c\u7b2c\u4e8c\u79cd\u5199\u6cd5\u6bd4\u7b2c\u4e00\u79cd\u7a0d\u5fae\u6162\u4e00\u70b9\uff0c\u4e2a\u4eba\u6bd4\u8f83\u63a8\u8350\u7b2c\u4e8c\u79cd\uff0c\u56e0\u4e3a\u4e0d\u9700\u8981\u50cf\u7b2c\u4e00\u79cd\u90a3\u6837\u52a0\u4e09\u4e2a\u6761\u4ef6\u907f\u514d\u6307\u9488\u8d70\u8fc7\u5934\u3002<\/strong><\/p>\n\n\n\n\u4f8b2.1.3\u9a8c\u8bc1<\/a>\u56de\u6587\u4e32<\/a><\/h3>\n\n\n\n\u5982\u679c\u5728\u5c06\u6240\u6709\u5927\u5199\u5b57\u7b26\u8f6c\u6362\u4e3a\u5c0f\u5199\u5b57\u7b26\u3001\u5e76\u79fb\u9664\u6240\u6709\u975e\u5b57\u6bcd\u6570\u5b57\u5b57\u7b26\u4e4b\u540e\uff0c\u77ed\u8bed\u6b63\u7740\u8bfb\u548c\u53cd\u7740\u8bfb\u90fd\u4e00\u6837\u3002\u5219\u53ef\u4ee5\u8ba4\u4e3a\u8be5\u77ed\u8bed\u662f\u4e00\u4e2a \u56de\u6587\u4e32<\/strong> \u3002<\/p>\n\n\n\n\u5b57\u6bcd\u548c\u6570\u5b57\u90fd\u5c5e\u4e8e\u5b57\u6bcd\u6570\u5b57\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u5b57\u7b26\u4e32 s<\/code>\uff0c\u5982\u679c\u5b83\u662f \u56de\u6587\u4e32<\/strong> \uff0c\u8fd4\u56de true <\/em>\uff1b\u5426\u5219\uff0c\u8fd4\u56de <\/em>false <\/em>\u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165:<\/strong> s = \"A man, a plan, a canal: Panama\"
\u8f93\u51fa\uff1a<\/strong>true
\u89e3\u91ca\uff1a<\/strong>\"amanaplanacanalpanama\" \u662f\u56de\u6587\u4e32\u3002<\/pre>\n\n\n\n\u8fd9\u9898\u9700\u8981\u6709\u4e00\u4e2a\u524d\u7f6e\u5904\u7406\uff0c\u5148\u5229\u7528\u5feb\u6162\u6307\u9488\u5c06\u542b\u6709\u975e\u5b57\u6bcd\u6570\u5b57\u5b57\u7b26\u7684\u5b57\u7b26\u4e32\u8f6c\u6362\u4e3a\u7eaf\u6570\u5b57\u5b57\u6bcd\u4e32\uff08\u540e\u9762\u540c\u5411\u6307\u9488\u91cc\u4f1a\u8bb2\u5230\uff09<\/p>\n\n\n\n
class Solution:\n def isPalindrome(self, s: str) -> bool:\n res=\"\"\n fast=0\n while fast<len(s):\n if s[fast].isalnum():\n res+=s[fast].lower()\n fast+=1\n head,tail=0,len(res)-1\n while head<tail:\n if res[head]!=res[tail]:\n return False\n head+=1\n tail-=1\n return True<\/code><\/pre>\n\n\n\n\u7136\u800c\uff0c\u8fd9\u6837\u5199\uff0c\u9996\u5148\u7a7a\u95f4\u590d\u6742\u5ea6\u4f1a\u53d8\u6210O\uff08n\uff09,\u65f6\u95f4\u590d\u6742\u5ea6\u8fd8\u4f1a\u53d8\u6210O(2*N)\uff0c\u8fd9\u662f\u6548\u7387\u6bd4\u8f83\u4f4e\u7684\u505a\u6cd5\uff0c\u5982\u679c\u4f7f\u7528if_else\u6765\u4ee3\u66ff\u7b2c\u4e00\u91cd\u5faa\u73af\uff0c\u5219\u4f1a\u53d8\u5f97\u975e\u5e38\u7b80\u6d01\u4e14\u5feb\u901f\u3002<\/strong><\/p>\n\n\n\nclass Solution:\n def isPalindrome(self, s: str) -> bool:\n head,tail=0,len(s)-1\n while head<tail:\n if not s[head].isalnum():\n head+=1\n elif not s[tail].isalnum():\n tail-=1\n else:\n if s[head].lower()!=s[tail].lower():\n return False\n head+=1\n tail-=1\n return True<\/code><\/pre>\n\n\n\n\u4f8b2.1.4\u7ed9\u690d\u7269\u6d47\u6c34\u2161<\/a><\/h3>\n\n\n\nlice \u548c Bob \u6253\u7b97\u7ed9\u82b1\u56ed\u91cc\u7684 n<\/code> \u682a\u690d\u7269\u6d47\u6c34\u3002\u690d\u7269\u6392\u6210\u4e00\u884c\uff0c\u4ece\u5de6\u5230\u53f3\u8fdb\u884c\u6807\u8bb0\uff0c\u7f16\u53f7\u4ece 0<\/code> \u5230 n – 1 \u3002\u5176\u4e2d\uff0c\u7b2c i<\/code> \u682a\u690d\u7269\u7684\u4f4d\u7f6e\u662f x = i \u3002<\/p>\n\n\n\n\u6bcf\u4e00\u682a\u690d\u7269\u90fd\u9700\u8981\u6d47\u7279\u5b9a\u91cf\u7684\u6c34\u3002Alice \u548c Bob \u6bcf\u4eba\u6709\u4e00\u4e2a\u6c34\u7f50\uff0c\u6700\u521d\u662f\u6ee1\u7684 <\/strong>\u3002\u4ed6\u4eec\u6309\u4e0b\u9762\u63cf\u8ff0\u7684\u65b9\u5f0f\u5b8c\u6210\u6d47\u6c34\uff1a<\/p>\n\n\n\n\n- Alice \u6309 \u4ece\u5de6\u5230\u53f3<\/strong> \u7684\u987a\u5e8f\u7ed9\u690d\u7269\u6d47\u6c34\uff0c\u4ece\u690d\u7269
0<\/code> \u5f00\u59cb\u3002Bob \u6309 \u4ece\u53f3\u5230\u5de6<\/strong> \u7684\u987a\u5e8f\u7ed9\u690d\u7269\u6d47\u6c34\uff0c\u4ece\u690d\u7269 n - 1<\/code> \u5f00\u59cb\u3002\u4ed6\u4eec \u540c\u65f6<\/strong> \u7ed9\u690d\u7269\u6d47\u6c34\u3002<\/li>\n\n\n\n- \u65e0\u8bba\u9700\u8981\u591a\u5c11\u6c34\uff0c\u4e3a\u6bcf\u682a\u690d\u7269\u6d47\u6c34\u6240\u9700\u7684\u65f6\u95f4\u90fd\u662f\u76f8\u540c\u7684\u3002<\/li>\n\n\n\n
- \u5982\u679c Alice\/Bob \u6c34\u7f50\u4e2d\u7684\u6c34\u8db3\u4ee5 \u5b8c\u5168<\/strong> \u704c\u6e89\u690d\u7269\uff0c\u4ed6\u4eec \u5fc5\u987b<\/strong> \u7ed9\u690d\u7269\u6d47\u6c34\u3002\u5426\u5219\uff0c\u4ed6\u4eec \u9996\u5148<\/strong>\uff08\u7acb\u5373\uff09\u91cd\u65b0\u88c5\u6ee1\u7f50\u5b50\uff0c\u7136\u540e\u7ed9\u690d\u7269\u6d47\u6c34\u3002<\/li>\n\n\n\n
- \u5982\u679c Alice \u548c Bob \u5230\u8fbe\u540c\u4e00\u682a\u690d\u7269\uff0c\u90a3\u4e48\u5f53\u524d\u6c34\u7f50\u4e2d\u6c34 \u66f4\u591a<\/strong> \u7684\u4eba\u4f1a\u7ed9\u8fd9\u682a\u690d\u7269\u6d47\u6c34\u3002\u5982\u679c\u4ed6\u4fe9\u6c34\u91cf\u76f8\u540c\uff0c\u90a3\u4e48 Alice \u4f1a\u7ed9\u8fd9\u682a\u690d\u7269\u6d47\u6c34\u3002<\/li>\n<\/ul>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u4e0b\u6807\u4ece 0<\/strong> \u5f00\u59cb\u7684\u6574\u6570\u6570\u7ec4 plants \uff0c\u6570\u7ec4\u7531 n<\/code> \u4e2a\u6574\u6570\u7ec4\u6210\u3002\u5176\u4e2d\uff0cplants[i] \u4e3a\u7b2c i<\/code> \u682a\u690d\u7269\u9700\u8981\u7684\u6c34\u91cf\u3002\u53e6\u6709\u4e24\u4e2a\u6574\u6570 capacityA \u548c capacityB \u5206\u522b\u8868\u793a Alice \u548c Bob \u6c34\u7f50\u7684\u5bb9\u91cf\u3002\u8fd4\u56de\u4e24\u4eba\u6d47\u704c\u6240\u6709\u690d\u7269\u8fc7\u7a0b\u4e2d\u91cd\u65b0\u704c\u6ee1\u6c34\u7f50\u7684 \u6b21\u6570<\/strong> \u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>plants = [2,2,3,3], capacityA = 5, capacityB = 5\n\u8f93\u51fa\uff1a<\/strong>1\n\u89e3\u91ca\uff1a<\/strong>\n- \u6700\u521d\uff0cAlice \u548c Bob \u7684\u6c34\u7f50\u4e2d\u5404\u6709 5 \u5355\u5143\u6c34\u3002\n- Alice \u7ed9\u690d\u7269 0 \u6d47\u6c34\uff0cBob \u7ed9\u690d\u7269 3 \u6d47\u6c34\u3002\n- Alice \u548c Bob \u73b0\u5728\u5206\u522b\u5269\u4e0b 3 \u5355\u5143\u548c 2 \u5355\u5143\u6c34\u3002\n- Alice \u6709\u8db3\u591f\u7684\u6c34\u7ed9\u690d\u7269 1 \uff0c\u6240\u4ee5\u5979\u76f4\u63a5\u6d47\u6c34\u3002Bob \u7684\u6c34\u4e0d\u591f\u7ed9\u690d\u7269 2 \uff0c\u6240\u4ee5\u4ed6\u5148\u91cd\u65b0\u88c5\u6ee1\u6c34\uff0c\u518d\u6d47\u6c34\u3002\n\u6240\u4ee5\uff0c\u4e24\u4eba\u6d47\u704c\u6240\u6709\u690d\u7269\u8fc7\u7a0b\u4e2d\u91cd\u65b0\u704c\u6ee1\u6c34\u7f50\u7684\u6b21\u6570 = 0 + 0 + 1 + 0 = 1 \u3002<\/pre>\n\n\n\n\u8fd9\u9053\u9898\u76ee\u672c\u8d28\u4e0a\u662f\u56de\u6587\u4e32\u7684\u601d\u8def\uff0c\u5176\u4e3a\u9996\u5c3e\u6307\u9488\u7684\u540c\u6b65\u6d47\u6c34\u3002\u6ce8\u610f\uff0c\u662f\u540c\u6b65\u6d47\u6c34\uff0cA\u6d47\u6c34\u4e00\u6b21\uff0cB\u5c31\u5fc5\u987b\u6d47\u6c34\u4e00\u6b21\u3002<\/strong>\u672c\u8d28\u4e0a\u4e0e\u56de\u6587\u4e32\u7684\u5224\u522b\u5e76\u65e0\u533a\u522b\u3002<\/p>\n\n\n\nclass <\/em>Solution:\n def <\/em>minimumRefill(self<\/em>, plants: List[int<\/em>], capacityA: int<\/em>, capacityB: int<\/em>) -> int<\/em>:\n head,tail=0,len<\/em>(plants)-1\n water_a=capacityA\n water_b=capacityB\n res=0\n while <\/em>head<tail:\n if <\/em>water_a<plants[head]:\n res+=1\n water_a=capacityA\n water_a-=plants[head]\n head+=1\n\n if <\/em>water_b<plants[tail]:\n res+=1\n water_b=capacityB\n water_b-=plants[tail]\n tail-=1\n\n return <\/em>res+1 if max<\/em>(water_b,water_a)<plants[head] else <\/em>res<\/code><\/pre>\n\n\n\n2.2\u5f02\u6b65\u76f8\u5411\u6307\u9488<\/h3>\n\n\n\n
\u6240\u8c13\u5f02\u6b65\u76f8\u5411\u6307\u9488\u5373\u662f\u5728\u76f8\u5411\u626b\u63cf\u8fc7\u7a0b\u4e2d\uff0chead\u4e0etail\u56e0\u4e3a\u4e00\u4e9b\u6761\u4ef6\u4f1a\u51fa\u73b0\u4e0d\u540c\u7a0b\u5ea6\u7684\u5f02\u6b65\u3002\u6bd4\u5982\u9009\u53d6\u4e24\u4e2a\u4e4b\u4e2d\u7684\u4e00\u4e2a\u4f5c\u4e3a\u7ed3\u679c\uff0c\u4e00\u4e2a\u79fb\u52a8\u4e00\u4e2a\u4e0d\u52a8\u3002\u4e5f\u6709\u5de6\u53f3\u5f02\u6b65\u79fb\u52a8\u4ee5\u6c42\u5f97\u4e00\u4e2a\u4e2d\u95f4\u533a\u95f4\u3002<\/p>\n\n\n\n
\u4f8b2.2.1\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u6309 \u975e\u9012\u51cf\u987a\u5e8f<\/strong> \u6392\u5e8f\u7684\u6574\u6570\u6570\u7ec4 nums\uff0c\u8fd4\u56de \u6bcf\u4e2a\u6570\u5b57\u7684\u5e73\u65b9<\/strong> \u7ec4\u6210\u7684\u65b0\u6570\u7ec4\uff0c\u8981\u6c42\u4e5f\u6309 \u975e\u9012\u51cf\u987a\u5e8f<\/strong> \u6392\u5e8f\u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>nums = [-4,-1,0,3,10]\n\u8f93\u51fa\uff1a<\/strong>[0,1,9,16,100]\n\u89e3\u91ca\uff1a<\/strong>\u5e73\u65b9\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [16,1,0,9,100]\n\u6392\u5e8f\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [0,1,9,16,100]<\/pre>\n\n\n\n\u9009\u53d6\u9996\u5c3e\u66f4\u5927\u7684\u4e00\u4e2a\u503c\u4f5c\u4e3a\u65b0\u6570\u7ec4\u7684\u503c\u52a0\u5165\uff0c\u6700\u540e\u7ffb\u8f6c\u5373\u53ef\u3002<\/p>\n\n\n\n
class Solution:\n def sortedSquares(self, nums: List[int]) -> List[int]:\n head,tail=0,len(nums)-1\n res=[]\n while head<=tail:\n a=pow(nums[head],2)\n b=pow(nums[tail],2)\n if a>=b:\n res.append(a)\n head+=1\n else:\n res.append(b)\n tail-=1\n return res[::-1]<\/code><\/pre>\n\n\n\n\u4f8b2.2.2\u627e\u5230K\u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20<\/a><\/h3>\n\n\n\n\u7ed9\u5b9a\u4e00\u4e2a \u6392\u5e8f\u597d<\/strong> \u7684\u6570\u7ec4 arr<\/code> \uff0c\u4e24\u4e2a\u6574\u6570 k<\/code> \u548c x<\/code> \uff0c\u4ece\u6570\u7ec4\u4e2d\u627e\u5230\u6700\u9760\u8fd1 x<\/code>\uff08\u4e24\u6570\u4e4b\u5dee\u6700\u5c0f\uff09\u7684 k<\/code> \u4e2a\u6570\u3002\u8fd4\u56de\u7684\u7ed3\u679c\u5fc5\u987b\u8981\u662f\u6309\u5347\u5e8f\u6392\u597d\u7684\u3002<\/p>\n\n\n\n\u6574\u6570 a<\/code> \u6bd4\u6574\u6570 b<\/code> \u66f4\u63a5\u8fd1 x<\/code> \u9700\u8981\u6ee1\u8db3\uff1a<\/p>\n\n\n\n\n- |a – x| < |b – x| \u6216\u8005<\/li>\n\n\n\n
- |a – x| == |b – x| \u4e14 a < b<\/li>\n<\/ul>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>arr = [1,2,3,4,5], k = 4, x = 3\n\u8f93\u51fa\uff1a<\/strong>[1,2,3,4]\n<\/pre>\n\n\n\n\u793a\u4f8b 2\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>arr = [1,1,2,3,4,5], k = 4, x = -1\n\u8f93\u51fa\uff1a<\/strong>[1,1,2,3]<\/pre>\n\n\n\n\u672c\u9898\u5c31\u662f\u5178\u578b\u5730\u901a\u8fc7\u5f02\u6b65\u76f8\u5411\u6307\u9488\u6c42\u4e2d\u95f4\u533a\u95f4\u3002\u5f53\u7136\uff0c\u4e5f\u6709\u975e\u5e38\u53d6\u5de7\u7684\u65b9\u6cd5\uff0c\u4e00\u884c\u4ee3\u7801\u5373\u53ef\u89e3\u9898\u3002<\/p>\n\n\n\n
\u65b9\u6cd5\u4e00\uff1a\u7edd\u5bf9\u503c\u6392\u5e8f<\/p>\n\n\n\n
def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:\n return sorted(sorted(arr,key=lambda num: abs(num-x))[:k])<\/code><\/pre>\n\n\n\n\u65b9\u6cd5\u4e8c\uff1a\u5f02\u6b65\u76f8\u5411\u6307\u9488\u6c42\u4e2d\u95f4\u533a\u95f4<\/p>\n\n\n\n
class Solution:\n def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:\n head,tail=0,len(arr)-1\n while tail-head+1>k:\n if abs(arr[head]-x)>abs(arr[tail]-x):\n head+=1\n else:\n tail-=1\n return arr[head:tail+1]<\/code><\/pre>\n\n\n\n\u4e24\u79cd\u65b9\u6cd5\u90fd\u6bd4\u8f83\u7b80\u6d01\uff0c\u7b14\u8005\u63a8\u8350\u5168\u90e8\u638c\u63e1\u3002<\/p>\n\n\n\n
\u4f8b2.2.3\u6570\u7ec4\u79cd\u7684k\u4e2a\u6700\u5f3a\u503c<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 arr \u548c\u4e00\u4e2a\u6574\u6570 k<\/code> \u3002<\/p>\n\n\n\n\u8bbe m<\/code> \u4e3a\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570\uff0c\u53ea\u8981\u6ee1\u8db3\u4e0b\u8ff0\u4e24\u4e2a\u524d\u63d0\u4e4b\u4e00\uff0c\u5c31\u53ef\u4ee5\u5224\u5b9a arr[i] \u7684\u503c\u6bd4 arr[j] \u7684\u503c\u66f4\u5f3a\uff1a<\/p>\n\n\n\n\n- |arr[i] – m| > |arr[j] – m|<\/li>\n\n\n\n
- |arr[i] – m| == |arr[j] – m|\uff0c\u4e14 arr[i] > arr[j]<\/li>\n<\/ul>\n\n\n\n
\u8bf7\u8fd4\u56de\u7531\u6570\u7ec4\u4e2d\u6700\u5f3a\u7684 k<\/code> \u4e2a\u503c\u7ec4\u6210\u7684\u5217\u8868\u3002\u7b54\u6848\u53ef\u4ee5\u4ee5 \u4efb\u610f\u987a\u5e8f<\/strong> \u8fd4\u56de\u3002<\/p>\n\n\n\n\u4e2d\u4f4d\u6570<\/strong> \u662f\u4e00\u4e2a\u6709\u5e8f\u6574\u6570\u5217\u8868\u4e2d\u5904\u4e8e\u4e2d\u95f4\u4f4d\u7f6e\u7684\u503c\u3002\u5f62\u5f0f\u4e0a\uff0c\u5982\u679c\u5217\u8868\u7684\u957f\u5ea6\u4e3a n<\/code> \uff0c\u90a3\u4e48\u4e2d\u4f4d\u6570\u5c31\u662f\u8be5\u6709\u5e8f\u5217\u8868\uff08\u4e0b\u6807\u4ece 0 \u5f00\u59cb\uff09\u4e2d\u4f4d\u4e8e ((<\/code>n - 1) \/ 2)<\/code> \u7684\u5143\u7d20\u3002<\/p>\n\n\n\n\n- \u4f8b\u5982
arr = [6, -3,<\/code> 7, 2, 11]<\/code>\uff0cn = 5\uff1a\u6570\u7ec4\u6392\u5e8f\u540e\u5f97\u5230 arr = [-3, 2, 6, 7, 11] \uff0c\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e\u4e3a m = ((5 – 1) \/ 2) = 2 \uff0c\u4e2d\u4f4d\u6570 arr[m] \u7684\u503c\u4e3a 6<\/code> \u3002<\/li>\n\n\n\n- \u4f8b\u5982
arr = [-7, 22,<\/code> 17,\u20093]<\/code>\uff0cn = 4<\/code>\uff1a\u6570\u7ec4\u6392\u5e8f\u540e\u5f97\u5230 arr = [-7, 3, 17, 22] \uff0c\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e\u4e3a m = ((4 – 1) \/ 2) = 1 \uff0c\u4e2d\u4f4d\u6570 arr[m] \u7684\u503c\u4e3a 3<\/code> \u3002<\/li>\n<\/ul>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>arr = [1,2,3,4,5], k = 2\n\u8f93\u51fa\uff1a<\/strong>[5,1]\n\u89e3\u91ca\uff1a<\/strong>\u4e2d\u4f4d\u6570\u4e3a 3\uff0c\u6309\u4ece\u5f3a\u5230\u5f31\u987a\u5e8f\u6392\u5e8f\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [5,1,4,2,3]\u3002\u6700\u5f3a\u7684\u4e24\u4e2a\u5143\u7d20\u662f [5, 1]\u3002[1, 5] \u4e5f\u662f\u6b63\u786e\u7b54\u6848\u3002\n\u6ce8\u610f\uff0c\u5c3d\u7ba1 |5 - 3| == |1 - 3| \uff0c\u4f46\u662f 5 \u6bd4 1 \u66f4\u5f3a\uff0c\u56e0\u4e3a 5 > 1 \u3002<\/pre>\n\n\n\n\u672c\u9898\u5176\u5b9e\u5c31\u662f\u4e0a\u4e00\u9898\u7684\u53cd\u9762\uff0c\u76f4\u63a5\u7167\u6284\u4e0a\u4e00\u9898\u4ee3\u7801\u7136\u540e\u7ffb\u8f6c\u4e00\u4e0b\u5c31\u884c\u4e86<\/p>\n\n\n\n
class Solution:\n def getStrongest(self, arr: List[int], k: int) -> List[int]:\n length=len(arr)-k\n arr=sorted(arr)\n x=arr[(len(arr)-1)\/\/2]\n head,tail=0,len(arr)-1\n while tail-head+1>length:\n if abs(arr[head]-x)>abs(arr[tail]-x):\n head+=1\n else:\n tail-=1\n return arr[:head]+arr[tail+1:]\n<\/code><\/pre>\n\n\n\n\u4f8b2.2.4\u4e24\u6570\u4e4b\u548c\u2161<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u4e0b\u6807\u4ece 1<\/strong> \u5f00\u59cb\u7684\u6574\u6570\u6570\u7ec4 numbers \uff0c\u8be5\u6570\u7ec4\u5df2\u6309 <\/em>\u975e\u9012\u51cf\u987a\u5e8f\u6392\u5217 <\/strong>\uff0c\u8bf7\u4f60\u4ece\u6570\u7ec4\u4e2d\u627e\u51fa\u6ee1\u8db3\u76f8\u52a0\u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570 target \u7684\u4e24\u4e2a\u6570\u3002\u5982\u679c\u8bbe\u8fd9\u4e24\u4e2a\u6570\u5206\u522b\u662f numbers[index1<\/sub>] \u548c numbers[index2<\/sub>] \uff0c\u5219 1 <= index1<\/sub> < index2<\/sub> <= numbers.length \u3002<\/p>\n\n\n\n\u4ee5\u957f\u5ea6\u4e3a 2 \u7684\u6574\u6570\u6570\u7ec4 [index1<\/sub>, index2<\/sub>] \u7684\u5f62\u5f0f\u8fd4\u56de\u8fd9\u4e24\u4e2a\u6574\u6570\u7684\u4e0b\u6807 index1<\/sub> <\/em>\u548c <\/em>index2<\/sub>\u3002<\/p>\n\n\n\n\u4f60\u53ef\u4ee5\u5047\u8bbe\u6bcf\u4e2a\u8f93\u5165 \u53ea\u5bf9\u5e94\u552f\u4e00\u7684\u7b54\u6848<\/strong> \uff0c\u800c\u4e14\u4f60 \u4e0d\u53ef\u4ee5<\/strong> \u91cd\u590d\u4f7f\u7528\u76f8\u540c\u7684\u5143\u7d20\u3002<\/p>\n\n\n\n\u4f60\u6240\u8bbe\u8ba1\u7684\u89e3\u51b3\u65b9\u6848\u5fc5\u987b\u53ea\u4f7f\u7528\u5e38\u91cf\u7ea7\u7684\u989d\u5916\u7a7a\u95f4\u3002<\/p>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>numbers = [2<\/em><\/strong>,7<\/em><\/strong>,11,15], target = 9\n\u8f93\u51fa\uff1a<\/strong>[1,2]\n\u89e3\u91ca\uff1a<\/strong>2 \u4e0e 7 \u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570 9 \u3002\u56e0\u6b64 index1<\/sub> = 1, index2<\/sub> = 2 \u3002\u8fd4\u56de [1, 2] \u3002<\/pre>\n\n\n\n\u672c\u9898\u5373\u662f\u4f7f\u7528\u5f02\u6b65\u6307\u9488\u641c\u7d22\u4e00\u4e2a\u5143\u7ec4\u3002\u56e0\u4e3a\u6570\u7ec4\u662f\u6709\u5e8f\u7684\uff0c\u6240\u4ee5\u53ef\u4ee5\u7528\u5f02\u6b65\u6307\u9488\u641c\u7d22\u548c\u3002<\/p>\n\n\n\n
def twoSum(self, numbers: List[int], target: int) -> List[int]:\n left,right=0,len(numbers)-1\n while left<right:\n cur_sum=numbers[left]+numbers[right]\n if cur_sum>target:\n right-=1\n elif cur_sum<target:\n left+=1\n else:\n return [left+1,right+1]\n return []<\/code><\/pre>\n\n\n\n<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6700\u8fd1\u7cfb\u7edf\u5b66\u4e60\u4e86\u90e8\u5206\u53cc\u6307\u9488\u7b97\u6cd5\u7684\u6280\u5de7\uff0c\u5728\u6b64\u7cfb\u7edf\u603b\u7ed3\u4e00\u4e0b\u3002 \u4e00\uff0c\u5f15\u8a00 \u53cc\u6307\u9488\u90e8\u5206\u7684\u9898\u76ee\u975e\u5e38\u591a\uff0c\u7075\u6d3b\u6027\u6bd4\u8f83\u9ad8\uff0c\u603b\u7ed3\u4e00 […]<\/p>\n","protected":false},"author":1,"featured_media":54,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-117","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-learning"],"_links":{"self":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/117","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/comments?post=117"}],"version-history":[{"count":7,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/117\/revisions"}],"predecessor-version":[{"id":127,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/117\/revisions\/127"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/media\/54"}],"wp:attachment":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/media?parent=117"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/categories?post=117"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/tags?post=117"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
s<\/code> \u7684\u5f62\u5f0f\u7ed9\u51fa\u3002<\/p>\n\n\n\n\u4e0d\u8981\u7ed9\u53e6\u5916\u7684\u6570\u7ec4\u5206\u914d\u989d\u5916\u7684\u7a7a\u95f4\uff0c\u4f60\u5fc5\u987b\u539f\u5730\u4fee\u6539\u8f93\u5165\u6570\u7ec4\u3001\u4f7f\u7528 O(1) \u7684\u989d\u5916\u7a7a\u95f4\u89e3\u51b3\u8fd9\u4e00\u95ee\u9898\u3002<\/p>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>s = [\"h\",\"e\",\"l\",\"l\",\"o\"]\n\u8f93\u51fa\uff1a<\/strong>[\"o\",\"l\",\"l\",\"e\",\"h\"]\n<\/pre>\n\n\n\n\u793a\u4f8b 2\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>s = [\"H\",\"a\",\"n\",\"n\",\"a\",\"h\"]
\u8f93\u51fa\uff1a<\/strong>[\"h\",\"a\",\"n\",\"n\",\"a\",\"H\"]<\/pre>\n\n\n\n\u4ee3\u7801\u5982\u4e0b\uff0c\u53ef\u4ee5\u770b\u5230\u975e\u5e38\u7b80\u5355\uff0c\u8bbe\u7f6e\u4e00\u4e2a\u5934\u6307\u9488\u4e00\u4e2a\u5c3e\u6307\u9488\u5373\u53ef\u3002<\/p>\n\n\n\n
class Solution:\n def reverseString(self, s: List[str]) -> None:\n \"\"\"\n Do not return anything, modify s in-place instead.\n \"\"\"\n head=0\n tail=len(s)-1\n while head<tail:\n s[head],s[tail]=s[tail],s[head]\n head+=1\n tail-=1\n\n<\/code><\/pre>\n\n\n\n\u4f8b2.1.2\u5782\u76f4\u7ffb\u8f6c\u5b50\u77e9\u9635<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a m x n \u7684\u6574\u6570\u77e9\u9635 grid\uff0c\u4ee5\u53ca\u4e09\u4e2a\u6574\u6570 x<\/code>\u3001y<\/code> \u548c k<\/code>\u3002<\/p>\n\n\n\n\u6574\u6570 x<\/code> \u548c y<\/code> \u8868\u793a\u4e00\u4e2a \u6b63\u65b9\u5f62\u5b50\u77e9\u9635 \u7684\u5de6\u4e0a\u89d2\u4e0b\u6807\uff0c\u6574\u6570 k \u8868\u793a\u8be5\u6b63\u65b9\u5f62\u5b50\u77e9\u9635\u7684\u8fb9\u957f\u3002<\/p>\n\n\n\n\u4f60\u7684\u4efb\u52a1\u662f\u5782\u76f4\u7ffb\u8f6c\u5b50\u77e9\u9635\u7684\u884c\u987a\u5e8f\u3002<\/p>\n\n\n\n
\u8fd4\u56de\u66f4\u65b0\u540e\u7684\u77e9\u9635\u3002<\/p>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n<\/div><\/figure>\n\n\n\n\u8f93\u5165\uff1a<\/strong> grid = [[1,2,3,4],[5,6,7,8],[9,10,11,12],[13,14,15,16]], x = 1, y = 0, k = 3<\/p>\n\n\n\n\u8f93\u51fa\uff1a<\/strong> [[1,2,3,4],[13,14,15,8],[9,10,11,12],[5,6,7,16]]<\/p>\n\n\n\n\u6b64\u9898\u5176\u5b9e\u4e0e\u53cd\u8f6c\u5b57\u7b26\u4e32\u6ca1\u4ec0\u4e48\u533a\u522b\uff0c\u53ea\u662f\u5c06\u5934\u5c3e\u6307\u9488\u6362\u6210\u4e86\u4e0a\u4e0b\u6307\u9488\u9010\u4e00\u4ea4\u6362\u884c\u5143\u7d20\u5373\u53ef\u3002\u540c\u65f6\u6d89\u53ca\u5230\u6279\u91cf\u4ea4\u6362\u5143\u7d20\uff0c\u53ef\u4ee5\u76f4\u63a5\u4f7f\u7528python\u5217\u8868\u91cc\u7684\u5207\u7247\u8d4b\u503c\u6765\u8fdb\u884c\u6279\u91cf\u53cd\u8f6c\uff0c\u8fd9\u6837\u53ef\u4ee5\u4f7f\u5f97\u4ee3\u7801\u975e\u5e38\u7b80\u6d01\u4e14\u6613\u61c2\u3002<\/strong><\/p>\n\n\n\nclass Solution:\n def reverseSubmatrix(self, grid: List[List[int]], x: int, y: int, k: int) -> List[List[int]]:\n head=x\n tail=x+k-1\n while head<tail:\n grid[head][y:y+k],grid[tail][y:y+k]=grid[tail][y:y+k],grid[head][y:y+k]\n head+=1\n tail-=1\n return grid\n\n<\/code><\/pre>\n\n\n\n\u4f8b2.1.3\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u5143\u97f3\u5b57\u6bcd<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u5b57\u7b26\u4e32 s<\/code> \uff0c\u4ec5\u53cd\u8f6c\u5b57\u7b26\u4e32\u4e2d\u7684\u6240\u6709\u5143\u97f3\u5b57\u6bcd\uff0c\u5e76\u8fd4\u56de\u7ed3\u679c\u5b57\u7b26\u4e32\u3002<\/p>\n\n\n\n\u5143\u97f3\u5b57\u6bcd\u5305\u62ec 'a'<\/code>\u3001'e'<\/code>\u3001'i'<\/code>\u3001'o'<\/code>\u3001'u'<\/code>\uff0c\u4e14\u53ef\u80fd\u4ee5\u5927\u5c0f\u5199\u4e24\u79cd\u5f62\u5f0f\u51fa\u73b0\u4e0d\u6b62\u4e00\u6b21\u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>s = “IceCreAm”<\/p>\n\n\n\n\u8f93\u51fa\uff1a<\/strong>“AceCreIm”<\/p>\n\n\n\n\u89e3\u91ca\uff1a<\/strong><\/p>\n\n\n\ns<\/code> \u4e2d\u7684\u5143\u97f3\u662f ['I', 'e', 'e', 'A']<\/code>\u3002\u53cd\u8f6c\u8fd9\u4e9b\u5143\u97f3\uff0cs<\/code> \u53d8\u4e3a “AceCreIm”.<\/p>\n\n\n\n\u6ce8\u610f\uff0c\u5728python\uff0cjava\u4e2d\u5b57\u7b26\u4e32\u5c5e\u4e8e\u4e0d\u53ef\u53d8\u91cf\uff0c\u4e0d\u53ef\u4ee5\u76f4\u63a5\u50cf\u6570\u7ec4\u4e00\u6837\u9996\u5c3e\u4ea4\u6362\uff0c\u9700\u8981\u5148\u8f6c\u6362\u4e3a\u6570\u7ec4\u7136\u540e\u518d\u8fdb\u884c\u64cd\u4f5c<\/strong>\u3002<\/p>\n\n\n\n\u5199\u6cd5\u4e00\uff1a\u5faa\u73af\u5d4c\u5957<\/p>\n\n\n\n
class Solution:\n def reverseVowels(self, s: str) -> str:\n head=0\n tail=len(s)-1\n temp=list(s)\n while head<tail:\n while head<len(s) and temp[head] not in 'aeiouAEIOU':\n head+=1\n while tail>=0 and s[tail] not in 'aeiouAEIOU':\n tail-=1\n if head>=tail:\n break\n temp[head],temp[tail]=temp[tail],temp[head]\n head+=1\n tail-=1\n return \"\".join(temp)<\/code><\/pre>\n\n\n\n\u5199\u6cd5\u4e8c\uff1aif-else\u5224\u65ad<\/p>\n\n\n\n
class Solution:\n def reverseVowels(self, s: str) -> str:\n head=0\n tail=len(s)-1\n temp=list(s)\n while head<tail:\n if s[head] not in 'aeiouAEIOU':\n head+=1\n elif s[tail] not in 'aeiouAEIOU':\n tail-=1\n else:\n temp[head],temp[tail]=temp[tail],temp[head]\n head+=1\n tail-=1\n return \"\".join(temp)\n<\/code><\/pre>\n\n\n\n\u4e0a\u8ff0\u4e24\u79cd\u5199\u6cd5\u90fd\u6bd4\u8f83\u76f4\u89c2\uff0c\u6027\u80fd\u4e5f\u51e0\u4e4e\u4e00\u76f4\uff0c\u7b2c\u4e8c\u79cd\u5199\u6cd5\u6bd4\u7b2c\u4e00\u79cd\u7a0d\u5fae\u6162\u4e00\u70b9\uff0c\u4e2a\u4eba\u6bd4\u8f83\u63a8\u8350\u7b2c\u4e8c\u79cd\uff0c\u56e0\u4e3a\u4e0d\u9700\u8981\u50cf\u7b2c\u4e00\u79cd\u90a3\u6837\u52a0\u4e09\u4e2a\u6761\u4ef6\u907f\u514d\u6307\u9488\u8d70\u8fc7\u5934\u3002<\/strong><\/p>\n\n\n\n\u4f8b2.1.3\u9a8c\u8bc1<\/a>\u56de\u6587\u4e32<\/a><\/h3>\n\n\n\n\u5982\u679c\u5728\u5c06\u6240\u6709\u5927\u5199\u5b57\u7b26\u8f6c\u6362\u4e3a\u5c0f\u5199\u5b57\u7b26\u3001\u5e76\u79fb\u9664\u6240\u6709\u975e\u5b57\u6bcd\u6570\u5b57\u5b57\u7b26\u4e4b\u540e\uff0c\u77ed\u8bed\u6b63\u7740\u8bfb\u548c\u53cd\u7740\u8bfb\u90fd\u4e00\u6837\u3002\u5219\u53ef\u4ee5\u8ba4\u4e3a\u8be5\u77ed\u8bed\u662f\u4e00\u4e2a \u56de\u6587\u4e32<\/strong> \u3002<\/p>\n\n\n\n\u5b57\u6bcd\u548c\u6570\u5b57\u90fd\u5c5e\u4e8e\u5b57\u6bcd\u6570\u5b57\u5b57\u7b26\u3002<\/p>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u5b57\u7b26\u4e32 s<\/code>\uff0c\u5982\u679c\u5b83\u662f \u56de\u6587\u4e32<\/strong> \uff0c\u8fd4\u56de true <\/em>\uff1b\u5426\u5219\uff0c\u8fd4\u56de <\/em>false <\/em>\u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165:<\/strong> s = \"A man, a plan, a canal: Panama\"
\u8f93\u51fa\uff1a<\/strong>true
\u89e3\u91ca\uff1a<\/strong>\"amanaplanacanalpanama\" \u662f\u56de\u6587\u4e32\u3002<\/pre>\n\n\n\n\u8fd9\u9898\u9700\u8981\u6709\u4e00\u4e2a\u524d\u7f6e\u5904\u7406\uff0c\u5148\u5229\u7528\u5feb\u6162\u6307\u9488\u5c06\u542b\u6709\u975e\u5b57\u6bcd\u6570\u5b57\u5b57\u7b26\u7684\u5b57\u7b26\u4e32\u8f6c\u6362\u4e3a\u7eaf\u6570\u5b57\u5b57\u6bcd\u4e32\uff08\u540e\u9762\u540c\u5411\u6307\u9488\u91cc\u4f1a\u8bb2\u5230\uff09<\/p>\n\n\n\n
class Solution:\n def isPalindrome(self, s: str) -> bool:\n res=\"\"\n fast=0\n while fast<len(s):\n if s[fast].isalnum():\n res+=s[fast].lower()\n fast+=1\n head,tail=0,len(res)-1\n while head<tail:\n if res[head]!=res[tail]:\n return False\n head+=1\n tail-=1\n return True<\/code><\/pre>\n\n\n\n\u7136\u800c\uff0c\u8fd9\u6837\u5199\uff0c\u9996\u5148\u7a7a\u95f4\u590d\u6742\u5ea6\u4f1a\u53d8\u6210O\uff08n\uff09,\u65f6\u95f4\u590d\u6742\u5ea6\u8fd8\u4f1a\u53d8\u6210O(2*N)\uff0c\u8fd9\u662f\u6548\u7387\u6bd4\u8f83\u4f4e\u7684\u505a\u6cd5\uff0c\u5982\u679c\u4f7f\u7528if_else\u6765\u4ee3\u66ff\u7b2c\u4e00\u91cd\u5faa\u73af\uff0c\u5219\u4f1a\u53d8\u5f97\u975e\u5e38\u7b80\u6d01\u4e14\u5feb\u901f\u3002<\/strong><\/p>\n\n\n\nclass Solution:\n def isPalindrome(self, s: str) -> bool:\n head,tail=0,len(s)-1\n while head<tail:\n if not s[head].isalnum():\n head+=1\n elif not s[tail].isalnum():\n tail-=1\n else:\n if s[head].lower()!=s[tail].lower():\n return False\n head+=1\n tail-=1\n return True<\/code><\/pre>\n\n\n\n\u4f8b2.1.4\u7ed9\u690d\u7269\u6d47\u6c34\u2161<\/a><\/h3>\n\n\n\nlice \u548c Bob \u6253\u7b97\u7ed9\u82b1\u56ed\u91cc\u7684 n<\/code> \u682a\u690d\u7269\u6d47\u6c34\u3002\u690d\u7269\u6392\u6210\u4e00\u884c\uff0c\u4ece\u5de6\u5230\u53f3\u8fdb\u884c\u6807\u8bb0\uff0c\u7f16\u53f7\u4ece 0<\/code> \u5230 n – 1 \u3002\u5176\u4e2d\uff0c\u7b2c i<\/code> \u682a\u690d\u7269\u7684\u4f4d\u7f6e\u662f x = i \u3002<\/p>\n\n\n\n\u6bcf\u4e00\u682a\u690d\u7269\u90fd\u9700\u8981\u6d47\u7279\u5b9a\u91cf\u7684\u6c34\u3002Alice \u548c Bob \u6bcf\u4eba\u6709\u4e00\u4e2a\u6c34\u7f50\uff0c\u6700\u521d\u662f\u6ee1\u7684 <\/strong>\u3002\u4ed6\u4eec\u6309\u4e0b\u9762\u63cf\u8ff0\u7684\u65b9\u5f0f\u5b8c\u6210\u6d47\u6c34\uff1a<\/p>\n\n\n\n\n- Alice \u6309 \u4ece\u5de6\u5230\u53f3<\/strong> \u7684\u987a\u5e8f\u7ed9\u690d\u7269\u6d47\u6c34\uff0c\u4ece\u690d\u7269
0<\/code> \u5f00\u59cb\u3002Bob \u6309 \u4ece\u53f3\u5230\u5de6<\/strong> \u7684\u987a\u5e8f\u7ed9\u690d\u7269\u6d47\u6c34\uff0c\u4ece\u690d\u7269 n - 1<\/code> \u5f00\u59cb\u3002\u4ed6\u4eec \u540c\u65f6<\/strong> \u7ed9\u690d\u7269\u6d47\u6c34\u3002<\/li>\n\n\n\n- \u65e0\u8bba\u9700\u8981\u591a\u5c11\u6c34\uff0c\u4e3a\u6bcf\u682a\u690d\u7269\u6d47\u6c34\u6240\u9700\u7684\u65f6\u95f4\u90fd\u662f\u76f8\u540c\u7684\u3002<\/li>\n\n\n\n
- \u5982\u679c Alice\/Bob \u6c34\u7f50\u4e2d\u7684\u6c34\u8db3\u4ee5 \u5b8c\u5168<\/strong> \u704c\u6e89\u690d\u7269\uff0c\u4ed6\u4eec \u5fc5\u987b<\/strong> \u7ed9\u690d\u7269\u6d47\u6c34\u3002\u5426\u5219\uff0c\u4ed6\u4eec \u9996\u5148<\/strong>\uff08\u7acb\u5373\uff09\u91cd\u65b0\u88c5\u6ee1\u7f50\u5b50\uff0c\u7136\u540e\u7ed9\u690d\u7269\u6d47\u6c34\u3002<\/li>\n\n\n\n
- \u5982\u679c Alice \u548c Bob \u5230\u8fbe\u540c\u4e00\u682a\u690d\u7269\uff0c\u90a3\u4e48\u5f53\u524d\u6c34\u7f50\u4e2d\u6c34 \u66f4\u591a<\/strong> \u7684\u4eba\u4f1a\u7ed9\u8fd9\u682a\u690d\u7269\u6d47\u6c34\u3002\u5982\u679c\u4ed6\u4fe9\u6c34\u91cf\u76f8\u540c\uff0c\u90a3\u4e48 Alice \u4f1a\u7ed9\u8fd9\u682a\u690d\u7269\u6d47\u6c34\u3002<\/li>\n<\/ul>\n\n\n\n
\u7ed9\u4f60\u4e00\u4e2a\u4e0b\u6807\u4ece 0<\/strong> \u5f00\u59cb\u7684\u6574\u6570\u6570\u7ec4 plants \uff0c\u6570\u7ec4\u7531 n<\/code> \u4e2a\u6574\u6570\u7ec4\u6210\u3002\u5176\u4e2d\uff0cplants[i] \u4e3a\u7b2c i<\/code> \u682a\u690d\u7269\u9700\u8981\u7684\u6c34\u91cf\u3002\u53e6\u6709\u4e24\u4e2a\u6574\u6570 capacityA \u548c capacityB \u5206\u522b\u8868\u793a Alice \u548c Bob \u6c34\u7f50\u7684\u5bb9\u91cf\u3002\u8fd4\u56de\u4e24\u4eba\u6d47\u704c\u6240\u6709\u690d\u7269\u8fc7\u7a0b\u4e2d\u91cd\u65b0\u704c\u6ee1\u6c34\u7f50\u7684 \u6b21\u6570<\/strong> \u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>plants = [2,2,3,3], capacityA = 5, capacityB = 5\n\u8f93\u51fa\uff1a<\/strong>1\n\u89e3\u91ca\uff1a<\/strong>\n- \u6700\u521d\uff0cAlice \u548c Bob \u7684\u6c34\u7f50\u4e2d\u5404\u6709 5 \u5355\u5143\u6c34\u3002\n- Alice \u7ed9\u690d\u7269 0 \u6d47\u6c34\uff0cBob \u7ed9\u690d\u7269 3 \u6d47\u6c34\u3002\n- Alice \u548c Bob \u73b0\u5728\u5206\u522b\u5269\u4e0b 3 \u5355\u5143\u548c 2 \u5355\u5143\u6c34\u3002\n- Alice \u6709\u8db3\u591f\u7684\u6c34\u7ed9\u690d\u7269 1 \uff0c\u6240\u4ee5\u5979\u76f4\u63a5\u6d47\u6c34\u3002Bob \u7684\u6c34\u4e0d\u591f\u7ed9\u690d\u7269 2 \uff0c\u6240\u4ee5\u4ed6\u5148\u91cd\u65b0\u88c5\u6ee1\u6c34\uff0c\u518d\u6d47\u6c34\u3002\n\u6240\u4ee5\uff0c\u4e24\u4eba\u6d47\u704c\u6240\u6709\u690d\u7269\u8fc7\u7a0b\u4e2d\u91cd\u65b0\u704c\u6ee1\u6c34\u7f50\u7684\u6b21\u6570 = 0 + 0 + 1 + 0 = 1 \u3002<\/pre>\n\n\n\n\u8fd9\u9053\u9898\u76ee\u672c\u8d28\u4e0a\u662f\u56de\u6587\u4e32\u7684\u601d\u8def\uff0c\u5176\u4e3a\u9996\u5c3e\u6307\u9488\u7684\u540c\u6b65\u6d47\u6c34\u3002\u6ce8\u610f\uff0c\u662f\u540c\u6b65\u6d47\u6c34\uff0cA\u6d47\u6c34\u4e00\u6b21\uff0cB\u5c31\u5fc5\u987b\u6d47\u6c34\u4e00\u6b21\u3002<\/strong>\u672c\u8d28\u4e0a\u4e0e\u56de\u6587\u4e32\u7684\u5224\u522b\u5e76\u65e0\u533a\u522b\u3002<\/p>\n\n\n\nclass <\/em>Solution:\n def <\/em>minimumRefill(self<\/em>, plants: List[int<\/em>], capacityA: int<\/em>, capacityB: int<\/em>) -> int<\/em>:\n head,tail=0,len<\/em>(plants)-1\n water_a=capacityA\n water_b=capacityB\n res=0\n while <\/em>head<tail:\n if <\/em>water_a<plants[head]:\n res+=1\n water_a=capacityA\n water_a-=plants[head]\n head+=1\n\n if <\/em>water_b<plants[tail]:\n res+=1\n water_b=capacityB\n water_b-=plants[tail]\n tail-=1\n\n return <\/em>res+1 if max<\/em>(water_b,water_a)<plants[head] else <\/em>res<\/code><\/pre>\n\n\n\n2.2\u5f02\u6b65\u76f8\u5411\u6307\u9488<\/h3>\n\n\n\n
\u6240\u8c13\u5f02\u6b65\u76f8\u5411\u6307\u9488\u5373\u662f\u5728\u76f8\u5411\u626b\u63cf\u8fc7\u7a0b\u4e2d\uff0chead\u4e0etail\u56e0\u4e3a\u4e00\u4e9b\u6761\u4ef6\u4f1a\u51fa\u73b0\u4e0d\u540c\u7a0b\u5ea6\u7684\u5f02\u6b65\u3002\u6bd4\u5982\u9009\u53d6\u4e24\u4e2a\u4e4b\u4e2d\u7684\u4e00\u4e2a\u4f5c\u4e3a\u7ed3\u679c\uff0c\u4e00\u4e2a\u79fb\u52a8\u4e00\u4e2a\u4e0d\u52a8\u3002\u4e5f\u6709\u5de6\u53f3\u5f02\u6b65\u79fb\u52a8\u4ee5\u6c42\u5f97\u4e00\u4e2a\u4e2d\u95f4\u533a\u95f4\u3002<\/p>\n\n\n\n
\u4f8b2.2.1\u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u6309 \u975e\u9012\u51cf\u987a\u5e8f<\/strong> \u6392\u5e8f\u7684\u6574\u6570\u6570\u7ec4 nums\uff0c\u8fd4\u56de \u6bcf\u4e2a\u6570\u5b57\u7684\u5e73\u65b9<\/strong> \u7ec4\u6210\u7684\u65b0\u6570\u7ec4\uff0c\u8981\u6c42\u4e5f\u6309 \u975e\u9012\u51cf\u987a\u5e8f<\/strong> \u6392\u5e8f\u3002<\/p>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>nums = [-4,-1,0,3,10]\n\u8f93\u51fa\uff1a<\/strong>[0,1,9,16,100]\n\u89e3\u91ca\uff1a<\/strong>\u5e73\u65b9\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [16,1,0,9,100]\n\u6392\u5e8f\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [0,1,9,16,100]<\/pre>\n\n\n\n\u9009\u53d6\u9996\u5c3e\u66f4\u5927\u7684\u4e00\u4e2a\u503c\u4f5c\u4e3a\u65b0\u6570\u7ec4\u7684\u503c\u52a0\u5165\uff0c\u6700\u540e\u7ffb\u8f6c\u5373\u53ef\u3002<\/p>\n\n\n\n
class Solution:\n def sortedSquares(self, nums: List[int]) -> List[int]:\n head,tail=0,len(nums)-1\n res=[]\n while head<=tail:\n a=pow(nums[head],2)\n b=pow(nums[tail],2)\n if a>=b:\n res.append(a)\n head+=1\n else:\n res.append(b)\n tail-=1\n return res[::-1]<\/code><\/pre>\n\n\n\n\u4f8b2.2.2\u627e\u5230K\u4e2a\u6700\u63a5\u8fd1\u7684\u5143\u7d20<\/a><\/h3>\n\n\n\n\u7ed9\u5b9a\u4e00\u4e2a \u6392\u5e8f\u597d<\/strong> \u7684\u6570\u7ec4 arr<\/code> \uff0c\u4e24\u4e2a\u6574\u6570 k<\/code> \u548c x<\/code> \uff0c\u4ece\u6570\u7ec4\u4e2d\u627e\u5230\u6700\u9760\u8fd1 x<\/code>\uff08\u4e24\u6570\u4e4b\u5dee\u6700\u5c0f\uff09\u7684 k<\/code> \u4e2a\u6570\u3002\u8fd4\u56de\u7684\u7ed3\u679c\u5fc5\u987b\u8981\u662f\u6309\u5347\u5e8f\u6392\u597d\u7684\u3002<\/p>\n\n\n\n\u6574\u6570 a<\/code> \u6bd4\u6574\u6570 b<\/code> \u66f4\u63a5\u8fd1 x<\/code> \u9700\u8981\u6ee1\u8db3\uff1a<\/p>\n\n\n\n\n- |a – x| < |b – x| \u6216\u8005<\/li>\n\n\n\n
- |a – x| == |b – x| \u4e14 a < b<\/li>\n<\/ul>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>arr = [1,2,3,4,5], k = 4, x = 3\n\u8f93\u51fa\uff1a<\/strong>[1,2,3,4]\n<\/pre>\n\n\n\n\u793a\u4f8b 2\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>arr = [1,1,2,3,4,5], k = 4, x = -1\n\u8f93\u51fa\uff1a<\/strong>[1,1,2,3]<\/pre>\n\n\n\n\u672c\u9898\u5c31\u662f\u5178\u578b\u5730\u901a\u8fc7\u5f02\u6b65\u76f8\u5411\u6307\u9488\u6c42\u4e2d\u95f4\u533a\u95f4\u3002\u5f53\u7136\uff0c\u4e5f\u6709\u975e\u5e38\u53d6\u5de7\u7684\u65b9\u6cd5\uff0c\u4e00\u884c\u4ee3\u7801\u5373\u53ef\u89e3\u9898\u3002<\/p>\n\n\n\n
\u65b9\u6cd5\u4e00\uff1a\u7edd\u5bf9\u503c\u6392\u5e8f<\/p>\n\n\n\n
def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:\n return sorted(sorted(arr,key=lambda num: abs(num-x))[:k])<\/code><\/pre>\n\n\n\n\u65b9\u6cd5\u4e8c\uff1a\u5f02\u6b65\u76f8\u5411\u6307\u9488\u6c42\u4e2d\u95f4\u533a\u95f4<\/p>\n\n\n\n
class Solution:\n def findClosestElements(self, arr: List[int], k: int, x: int) -> List[int]:\n head,tail=0,len(arr)-1\n while tail-head+1>k:\n if abs(arr[head]-x)>abs(arr[tail]-x):\n head+=1\n else:\n tail-=1\n return arr[head:tail+1]<\/code><\/pre>\n\n\n\n\u4e24\u79cd\u65b9\u6cd5\u90fd\u6bd4\u8f83\u7b80\u6d01\uff0c\u7b14\u8005\u63a8\u8350\u5168\u90e8\u638c\u63e1\u3002<\/p>\n\n\n\n
\u4f8b2.2.3\u6570\u7ec4\u79cd\u7684k\u4e2a\u6700\u5f3a\u503c<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 arr \u548c\u4e00\u4e2a\u6574\u6570 k<\/code> \u3002<\/p>\n\n\n\n\u8bbe m<\/code> \u4e3a\u6570\u7ec4\u7684\u4e2d\u4f4d\u6570\uff0c\u53ea\u8981\u6ee1\u8db3\u4e0b\u8ff0\u4e24\u4e2a\u524d\u63d0\u4e4b\u4e00\uff0c\u5c31\u53ef\u4ee5\u5224\u5b9a arr[i] \u7684\u503c\u6bd4 arr[j] \u7684\u503c\u66f4\u5f3a\uff1a<\/p>\n\n\n\n\n- |arr[i] – m| > |arr[j] – m|<\/li>\n\n\n\n
- |arr[i] – m| == |arr[j] – m|\uff0c\u4e14 arr[i] > arr[j]<\/li>\n<\/ul>\n\n\n\n
\u8bf7\u8fd4\u56de\u7531\u6570\u7ec4\u4e2d\u6700\u5f3a\u7684 k<\/code> \u4e2a\u503c\u7ec4\u6210\u7684\u5217\u8868\u3002\u7b54\u6848\u53ef\u4ee5\u4ee5 \u4efb\u610f\u987a\u5e8f<\/strong> \u8fd4\u56de\u3002<\/p>\n\n\n\n\u4e2d\u4f4d\u6570<\/strong> \u662f\u4e00\u4e2a\u6709\u5e8f\u6574\u6570\u5217\u8868\u4e2d\u5904\u4e8e\u4e2d\u95f4\u4f4d\u7f6e\u7684\u503c\u3002\u5f62\u5f0f\u4e0a\uff0c\u5982\u679c\u5217\u8868\u7684\u957f\u5ea6\u4e3a n<\/code> \uff0c\u90a3\u4e48\u4e2d\u4f4d\u6570\u5c31\u662f\u8be5\u6709\u5e8f\u5217\u8868\uff08\u4e0b\u6807\u4ece 0 \u5f00\u59cb\uff09\u4e2d\u4f4d\u4e8e ((<\/code>n - 1) \/ 2)<\/code> \u7684\u5143\u7d20\u3002<\/p>\n\n\n\n\n- \u4f8b\u5982
arr = [6, -3,<\/code> 7, 2, 11]<\/code>\uff0cn = 5\uff1a\u6570\u7ec4\u6392\u5e8f\u540e\u5f97\u5230 arr = [-3, 2, 6, 7, 11] \uff0c\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e\u4e3a m = ((5 – 1) \/ 2) = 2 \uff0c\u4e2d\u4f4d\u6570 arr[m] \u7684\u503c\u4e3a 6<\/code> \u3002<\/li>\n\n\n\n- \u4f8b\u5982
arr = [-7, 22,<\/code> 17,\u20093]<\/code>\uff0cn = 4<\/code>\uff1a\u6570\u7ec4\u6392\u5e8f\u540e\u5f97\u5230 arr = [-7, 3, 17, 22] \uff0c\u6570\u7ec4\u7684\u4e2d\u95f4\u4f4d\u7f6e\u4e3a m = ((4 – 1) \/ 2) = 1 \uff0c\u4e2d\u4f4d\u6570 arr[m] \u7684\u503c\u4e3a 3<\/code> \u3002<\/li>\n<\/ul>\n\n\n\n\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>arr = [1,2,3,4,5], k = 2\n\u8f93\u51fa\uff1a<\/strong>[5,1]\n\u89e3\u91ca\uff1a<\/strong>\u4e2d\u4f4d\u6570\u4e3a 3\uff0c\u6309\u4ece\u5f3a\u5230\u5f31\u987a\u5e8f\u6392\u5e8f\u540e\uff0c\u6570\u7ec4\u53d8\u4e3a [5,1,4,2,3]\u3002\u6700\u5f3a\u7684\u4e24\u4e2a\u5143\u7d20\u662f [5, 1]\u3002[1, 5] \u4e5f\u662f\u6b63\u786e\u7b54\u6848\u3002\n\u6ce8\u610f\uff0c\u5c3d\u7ba1 |5 - 3| == |1 - 3| \uff0c\u4f46\u662f 5 \u6bd4 1 \u66f4\u5f3a\uff0c\u56e0\u4e3a 5 > 1 \u3002<\/pre>\n\n\n\n\u672c\u9898\u5176\u5b9e\u5c31\u662f\u4e0a\u4e00\u9898\u7684\u53cd\u9762\uff0c\u76f4\u63a5\u7167\u6284\u4e0a\u4e00\u9898\u4ee3\u7801\u7136\u540e\u7ffb\u8f6c\u4e00\u4e0b\u5c31\u884c\u4e86<\/p>\n\n\n\n
class Solution:\n def getStrongest(self, arr: List[int], k: int) -> List[int]:\n length=len(arr)-k\n arr=sorted(arr)\n x=arr[(len(arr)-1)\/\/2]\n head,tail=0,len(arr)-1\n while tail-head+1>length:\n if abs(arr[head]-x)>abs(arr[tail]-x):\n head+=1\n else:\n tail-=1\n return arr[:head]+arr[tail+1:]\n<\/code><\/pre>\n\n\n\n\u4f8b2.2.4\u4e24\u6570\u4e4b\u548c\u2161<\/a><\/h3>\n\n\n\n\u7ed9\u4f60\u4e00\u4e2a\u4e0b\u6807\u4ece 1<\/strong> \u5f00\u59cb\u7684\u6574\u6570\u6570\u7ec4 numbers \uff0c\u8be5\u6570\u7ec4\u5df2\u6309 <\/em>\u975e\u9012\u51cf\u987a\u5e8f\u6392\u5217 <\/strong>\uff0c\u8bf7\u4f60\u4ece\u6570\u7ec4\u4e2d\u627e\u51fa\u6ee1\u8db3\u76f8\u52a0\u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570 target \u7684\u4e24\u4e2a\u6570\u3002\u5982\u679c\u8bbe\u8fd9\u4e24\u4e2a\u6570\u5206\u522b\u662f numbers[index1<\/sub>] \u548c numbers[index2<\/sub>] \uff0c\u5219 1 <= index1<\/sub> < index2<\/sub> <= numbers.length \u3002<\/p>\n\n\n\n\u4ee5\u957f\u5ea6\u4e3a 2 \u7684\u6574\u6570\u6570\u7ec4 [index1<\/sub>, index2<\/sub>] \u7684\u5f62\u5f0f\u8fd4\u56de\u8fd9\u4e24\u4e2a\u6574\u6570\u7684\u4e0b\u6807 index1<\/sub> <\/em>\u548c <\/em>index2<\/sub>\u3002<\/p>\n\n\n\n\u4f60\u53ef\u4ee5\u5047\u8bbe\u6bcf\u4e2a\u8f93\u5165 \u53ea\u5bf9\u5e94\u552f\u4e00\u7684\u7b54\u6848<\/strong> \uff0c\u800c\u4e14\u4f60 \u4e0d\u53ef\u4ee5<\/strong> \u91cd\u590d\u4f7f\u7528\u76f8\u540c\u7684\u5143\u7d20\u3002<\/p>\n\n\n\n\u4f60\u6240\u8bbe\u8ba1\u7684\u89e3\u51b3\u65b9\u6848\u5fc5\u987b\u53ea\u4f7f\u7528\u5e38\u91cf\u7ea7\u7684\u989d\u5916\u7a7a\u95f4\u3002<\/p>\n\n\n\n
\u793a\u4f8b 1\uff1a<\/strong><\/p>\n\n\n\n\u8f93\u5165\uff1a<\/strong>numbers = [2<\/em><\/strong>,7<\/em><\/strong>,11,15], target = 9\n\u8f93\u51fa\uff1a<\/strong>[1,2]\n\u89e3\u91ca\uff1a<\/strong>2 \u4e0e 7 \u4e4b\u548c\u7b49\u4e8e\u76ee\u6807\u6570 9 \u3002\u56e0\u6b64 index1<\/sub> = 1, index2<\/sub> = 2 \u3002\u8fd4\u56de [1, 2] \u3002<\/pre>\n\n\n\n\u672c\u9898\u5373\u662f\u4f7f\u7528\u5f02\u6b65\u6307\u9488\u641c\u7d22\u4e00\u4e2a\u5143\u7ec4\u3002\u56e0\u4e3a\u6570\u7ec4\u662f\u6709\u5e8f\u7684\uff0c\u6240\u4ee5\u53ef\u4ee5\u7528\u5f02\u6b65\u6307\u9488\u641c\u7d22\u548c\u3002<\/p>\n\n\n\n
def twoSum(self, numbers: List[int], target: int) -> List[int]:\n left,right=0,len(numbers)-1\n while left<right:\n cur_sum=numbers[left]+numbers[right]\n if cur_sum>target:\n right-=1\n elif cur_sum<target:\n left+=1\n else:\n return [left+1,right+1]\n return []<\/code><\/pre>\n\n\n\n<\/p>\n","protected":false},"excerpt":{"rendered":"
\u6700\u8fd1\u7cfb\u7edf\u5b66\u4e60\u4e86\u90e8\u5206\u53cc\u6307\u9488\u7b97\u6cd5\u7684\u6280\u5de7\uff0c\u5728\u6b64\u7cfb\u7edf\u603b\u7ed3\u4e00\u4e0b\u3002 \u4e00\uff0c\u5f15\u8a00 \u53cc\u6307\u9488\u90e8\u5206\u7684\u9898\u76ee\u975e\u5e38\u591a\uff0c\u7075\u6d3b\u6027\u6bd4\u8f83\u9ad8\uff0c\u603b\u7ed3\u4e00 […]<\/p>\n","protected":false},"author":1,"featured_media":54,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-117","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-learning"],"_links":{"self":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/117","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/comments?post=117"}],"version-history":[{"count":7,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/117\/revisions"}],"predecessor-version":[{"id":127,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/posts\/117\/revisions\/127"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/media\/54"}],"wp:attachment":[{"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/media?parent=117"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/categories?post=117"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/yxzhangcoco.xyz\/index.php\/wp-json\/wp\/v2\/tags?post=117"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
![\"\"\/](\"https:\/\/assets.leetcode.com\/uploads\/2025\/07\/20\/gridexmdrawio.png\")
<\/div><\/figure>\n\n\n\n