function search(nums: number[], target: number): number {\n let mid: number, left: number = 0, right: number = nums.length - 1;\n while (left <= right) {\n \/\/ \u4f4d\u8fd0\u7b97 + \u9632\u6b62\u5927\u6570\u6ea2\u51fa\n mid = left + ((right - left) >> 1);\n if (nums[mid] > target) {\n right = mid - 1;\n } else if (nums[mid] < target) {\n left = mid + 1;\n } else {\n return mid;\n }\n }\n return -1;\n};\n<\/code><\/pre>\n\n\n\n\u53cc\u6307\u9488 \u5feb\u6162\u6307\u9488 \u79fb\u9664\u5143\u7d20 <\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u66b4\u529b\u89e3\u6cd5(\u6211\u7684\u60f3\u6cd5) : <\/p>\n\n\n\n
\u904d\u5386\u6570\u7ec4 \u5c06\u6240\u6709\u7b49\u4e8e\u8981\u79fb\u9664\u5143\u7d20\u8d4b\u503c\u4e3a-1 \u7136\u540e\u518d\u8fdb\u884c\u5012\u5e8f\u6392\u5217\u5373\u53ef \u65f6\u95f4\u590d\u6742\u5ea6O(nlogn)<\/p>\n\n\n\n
function removeElement(nums: number[], val: number): number {\n let len:number = nums.length\n let cnt:number = 0\n for(let i = 0;i < len;i++){\n if(nums[i] === val){\n cnt++\n nums[i] = -1\n }\n }\n nums.sort((a,b)=> b-a)\n return len - cnt\n};<\/code><\/pre>\n\n\n\n\u5feb\u6162\u6307\u9488<\/p>\n\n\n\n
\u901a\u8fc7\u4e00\u4e2a\u5feb\u6307\u9488\u548c\u6162\u6307\u9488\u5728\u4e00\u4e2afor\u5faa\u73af\u4e0b\u5b8c\u6210\u4e24\u4e2afor\u5faa\u73af\u7684\u5de5\u4f5c<\/strong> \u65f6\u95f4\u590d\u6742\u5ea6O(n)<\/p>\n\n\n\n\u5b9a\u4e49\u5feb\u6162\u6307\u9488<\/p>\n\n\n\n
\n- \u5feb\u6307\u9488\uff1a\u5bfb\u627e\u65b0\u6570\u7ec4\u7684\u5143\u7d20 \uff0c\u65b0\u6570\u7ec4\u5c31\u662f\u4e0d\u542b\u6709\u76ee\u6807\u5143\u7d20\u7684\u6570\u7ec4<\/li>\n\n\n\n
- \u6162\u6307\u9488\uff1a\u6307\u5411\u66f4\u65b0 \u65b0\u6570\u7ec4\u4e0b\u6807\u7684\u4f4d\u7f6e<\/li>\n<\/ul>\n\n\n\n
function removeElement(nums: number[], val: number): number {\n let slowIndex: number = 0, fastIndex: number = 0;\n while (fastIndex < nums.length) {\n if (nums[fastIndex] !== val) {\n nums[slowIndex++] = nums[fastIndex];\n }\n fastIndex++;\n }\n return slowIndex;\n};<\/code><\/pre>\n\n\n\n\u793a\u610f\u56fe<\/p>\n\n\n\n
https:\/\/pic.leetcode-cn.com\/1619009113-SlyHyv-008eGmZEly1gntrds6r59g30du09mnpd.gif<\/a><\/p>\n\n\n\n\u53cc\u6307\u9488 \u6709\u5e8f\u6570\u7ec4\u7684\u5e73\u65b9 <\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u6570\u7ec4\u5176\u5b9e\u662f\u6709\u5e8f\u7684\uff0c \u53ea\u4e0d\u8fc7\u8d1f\u6570\u5e73\u65b9\u4e4b\u540e\u53ef\u80fd\u6210\u4e3a\u6700\u5927\u6570\u4e86<\/p>\n\n\n\n
\u6570\u7ec4\u5e73\u65b9\u7684\u6700\u5927\u503c\u5c31\u5728\u6570\u7ec4\u7684\u4e24\u7aef\uff0c\u4e0d\u662f\u6700\u5de6\u8fb9\u5c31\u662f\u6700\u53f3\u8fb9\uff0c\u4e0d\u53ef\u80fd\u662f\u4e2d\u95f4<\/p>\n\n\n\n
\u6b64\u65f6\u53ef\u4ee5\u8003\u8651\u53cc\u6307\u9488\u6cd5\u4e86\uff0ci\u6307\u5411\u5176\u5b9e\u4f4d\u7f6e\uff0cj\u6307\u5411\u7ec8\u6b62\u4f4d\u7f6e<\/p>\n\n\n\n
\u5b9a\u4e49\u4e00\u4e2a\u65b0\u6570\u7ec4result\uff0c\u548cA\u6570\u7ec4\u4e00\u6837\u7684\u5927\u5c0f\uff0c\u8ba9k\u6307\u5411result\u6570\u7ec4\u7ec8\u6b62\u4f4d\u7f6e<\/p>\n\n\n\n
\u5982\u679cA[i] * A[i] < A[j] * A[j] \u90a3\u4e48result[k–] = A[j] * A[j]; <\/p>\n\n\n\n
\u5982\u679cA[i] * A[i] >= A[j] * A[j] \u90a3\u4e48result[k–] = A[i] * A[i]; <\/p>\n\n\n\n
\u793a\u610f\u56fe<\/p>\n\n\n\n
https:\/\/pic.leetcode-cn.com\/1602811839-xiaxXW-977.%E6%9C%89%E5%BA%8F%E6%95%B0%E7%BB%84%E7%9A%84%E5%B9%B3%E6%96%B9.gif<\/a><\/p>\n\n\n\nfunction sortedSquares(nums: number[]): number[] {\n let i = 0;\n let j = nums.length - 1;\n let result = new Array(nums.length); \/\/ \u76f4\u63a5\u521b\u5efa\u5b9a\u957f\u6570\u7ec4\n\n for (let k = nums.length - 1; k >= 0; k--) {\n const leftSquare = nums[i] * nums[i];\n const rightSquare = nums[j] * nums[j];\n \n if (leftSquare > rightSquare) {\n result[k] = leftSquare;\n i++;\n } else {\n result[k] = rightSquare;\n j--;\n }\n }\n \n return result;\n}<\/code><\/pre>\n\n\n\n\u6ed1\u52a8\u7a97\u53e3 \u53cc\u6307\u9488 \u957f\u5ea6\u6700\u5c0f\u7684\u5b50\u6570\u7ec4 <\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u66b4\u529b\u89e3\u6cd5 —> \u8d85\u65f6\u4e86! \u65f6\u95f4\u590d\u6742\u5ea6O(n*n)<\/p>\n\n\n\n
function minSubArrayLen(target: number, nums: number[]): number {\n let subLength = 0 \/\/\u5b50\u6570\u7ec4\u957f\u5ea6\n let result = 1e10 \/\/\u6700\u540e\u7ed3\u679c\n let sum = 0 \/\/\u5b50\u6570\u7ec4\u603b\u548c\n for(let i=0 ;i<nums.length;i++){\n sum = 0\n for(let j =i;j<nums.length;j++){\n sum += nums[j]\n if(sum>=target){\n subLength = j - i + 1\n break \/\/\u53d1\u73b0\u5373\u7ec8\u6b62 \u518d\u7ee7\u7eed\u4e0b\u53bb\u5df2\u7ecf\u6ca1\u6709\u5fc5\u8981\n }\n }\n result = result > subLength ? subLength : result\n }\n return result ? result : 0\n}<\/code><\/pre>\n\n\n\n\u6ed1\u52a8\u7a97\u53e3<\/strong> \u65f6\u95f4\u590d\u6742\u5ea6O(n)<\/p>\n\n\n\n\u6240\u8c13\u6ed1\u52a8\u7a97\u53e3\uff0c\u5c31\u662f\u4e0d\u65ad\u7684\u8c03\u8282\u5b50\u5e8f\u5217\u7684\u8d77\u59cb\u4f4d\u7f6e\u548c\u7ec8\u6b62\u4f4d\u7f6e\uff0c\u4ece\u800c\u5f97\u51fa\u6211\u4eec\u8981\u60f3\u7684\u7ed3\u679c<\/p>\n\n\n\n
\u5728\u66b4\u529b\u89e3\u6cd5\u4e2d\uff0c\u662f\u4e00\u4e2afor\u5faa\u73af\u6ed1\u52a8\u7a97\u53e3\u7684\u8d77\u59cb\u4f4d\u7f6e\uff0c\u4e00\u4e2afor\u5faa\u73af\u4e3a\u6ed1\u52a8\u7a97\u53e3\u7684\u7ec8\u6b62\u4f4d\u7f6e\uff0c\u7528\u4e24\u4e2afor\u5faa\u73af \u5b8c\u6210\u4e86\u4e00\u4e2a\u4e0d\u65ad\u641c\u7d22\u533a\u95f4\u7684\u8fc7\u7a0b<\/p>\n\n\n\n
\u90a3\u4e48\u6ed1\u52a8\u7a97\u53e3\u5982\u4f55\u7528\u4e00\u4e2afor\u5faa\u73af\u6765\u5b8c\u6210\u8fd9\u4e2a\u64cd\u4f5c\u5462<\/p>\n\n\n\n
\u9996\u5148\u8981\u601d\u8003 \u5982\u679c\u7528\u4e00\u4e2afor\u5faa\u73af\uff0c\u90a3\u4e48\u5e94\u8be5\u8868\u793a \u6ed1\u52a8\u7a97\u53e3\u7684\u8d77\u59cb\u4f4d\u7f6e\uff0c\u8fd8\u662f\u7ec8\u6b62\u4f4d\u7f6e<\/p>\n\n\n\n
\u5982\u679c\u53ea\u7528\u4e00\u4e2afor\u5faa\u73af\u6765\u8868\u793a \u6ed1\u52a8\u7a97\u53e3\u7684\u8d77\u59cb\u4f4d\u7f6e\uff0c\u90a3\u4e48\u5982\u4f55\u904d\u5386\u5269\u4e0b\u7684\u7ec8\u6b62\u4f4d\u7f6e?<\/p>\n\n\n\n
\u6b64\u65f6\u96be\u514d\u518d\u6b21\u9677\u5165 \u66b4\u529b\u89e3\u6cd5\u7684\u602a\u5708<\/p>\n\n\n\n
\u6240\u4ee5 \u53ea\u7528\u4e00\u4e2afor\u5faa\u73af\uff0c\u90a3\u4e48\u8fd9\u4e2a\u5faa\u73af\u7684\u7d22\u5f15\uff0c\u4e00\u5b9a\u662f\u8868\u793a \u6ed1\u52a8\u7a97\u53e3\u7684\u7ec8\u6b62\u4f4d\u7f6e<\/p>\n\n\n\n
<\/p>\n\n\n\n
\u793a\u610f\u56fe<\/p>\n\n\n\n
https:\/\/pic.leetcode-cn.com\/1659059220-jxMpDA-209.%E9%95%BF%E5%BA%A6%E6%9C%80%E5%B0%8F%E7%9A%84%E5%AD%90%E6%95%B0%E7%BB%84.gif<\/a><\/p>\n\n\n\nfunction minSubArrayLen(target: number, nums: number[]): number {\n let left:number = 0\n let sum:number = 0\n let res = Infinity\n for(let right = 0;right<nums.length;right++){\n sum+=nums[right]\n while(sum>=target){\n res = Math.min(res,right - left + 1)\n sum -= nums[left++]\n }\n }\n return res === Infinity ? 0 : res\n}<\/code><\/pre>\n\n\n\n\u6ce8\u610f!<\/strong><\/p>\n\n\n\n\u4e0d\u8981\u4ee5\u4e3afor\u91cc\u653e\u4e00\u4e2awhile\u5c31\u4ee5\u4e3a\u662fO(n^2)\u554a\uff0c \u4e3b\u8981\u662f\u770b\u6bcf\u4e00\u4e2a\u5143\u7d20\u88ab\u64cd\u4f5c\u7684\u6b21\u6570\uff0c\u6bcf\u4e2a\u5143\u7d20\u5728\u6ed1\u52a8\u7a97\u540e\u8fdb\u6765\u64cd\u4f5c\u4e00\u6b21\uff0c\u51fa\u53bb\u64cd\u4f5c\u4e00\u6b21\uff0c\u6bcf\u4e2a\u5143\u7d20\u90fd\u662f\u88ab\u64cd\u4f5c\u4e24\u6b21\uff0c\u6240\u4ee5\u65f6\u95f4\u590d\u6742\u5ea6\u662f 2 \u00d7 n \u4e5f\u5c31\u662fO(n)<\/p>\n\n\n\n
\u53cc\u91cd\u5faa\u73af \u87ba\u65cb\u77e9\u9635II <\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u575a\u6301\u5faa\u73af\u4e0d\u53d8\u91cf\u539f\u5219<\/p>\n\n\n\n
\u6a21\u62df\u987a\u65f6\u9488\u753b\u77e9\u9635\u7684\u8fc7\u7a0b:<\/p>\n\n\n\n
\n- \u586b\u5145\u4e0a\u884c\u4ece\u5de6\u5230\u53f3<\/li>\n\n\n\n
- \u586b\u5145\u53f3\u5217\u4ece\u4e0a\u5230\u4e0b<\/li>\n\n\n\n
- \u586b\u5145\u4e0b\u884c\u4ece\u53f3\u5230\u5de6<\/li>\n\n\n\n
- \u586b\u5145\u5de6\u5217\u4ece\u4e0b\u5230\u4e0a<\/li>\n<\/ul>\n\n\n\n
![\"\"](\"data:image\/svg+xml;base64,PCEtLUFyZ29uTG9hZGluZy0tPgo8c3ZnIHdpZHRoPSIxIiBoZWlnaHQ9IjEiIHhtbG5zPSJodHRwOi8vd3d3LnczLm9yZy8yMDAwL3N2ZyIgc3Ryb2tlPSIjZmZmZmZmMDAiPjxnPjwvZz4KPC9zdmc+\")
<\/div><\/figure>\n\n\n\n\u8fd9\u91cc\u6bcf\u4e00\u79cd\u989c\u8272\uff0c\u4ee3\u8868\u4e00\u6761\u8fb9\uff0c\u6211\u4eec\u904d\u5386\u7684\u957f\u5ea6\uff0c\u53ef\u4ee5\u770b\u51fa\u6bcf\u4e00\u4e2a\u62d0\u89d2\u5904\u7684\u5904\u7406\u89c4\u5219\uff0c\u62d0\u89d2\u5904\u8ba9\u7ed9\u65b0\u7684\u4e00\u6761\u8fb9\u6765\u7ee7\u7eed\u753b<\/p>\n\n\n\n
function generateMatrix(n: number): number[][] {\n let loopNum: number = Math.floor(n \/ 2);\/\/\u53f3 -> \u4e0b -> \u5de6 -> \u4e0a\u4e00\u4e2a\u5faa\u73af\u7684\u5faa\u73af\u6b21\u6570\n const resArr: number[][] = new Array(n).fill(1).map(i => new Array(n));\/\/\u521b\u5efa\u4e8c\u7ef4\u6570\u7ec4\n let chunkNum: number = n - 1; \/\/\u6bcf\u4e00\u4e2a\u79fb\u52a8\u65b9\u5411\u5206\u5757\u5904\u7406\u4e2a\u6570\n \/\/\u4e00\u4e2a\u5faa\u73af\u7684\u8d77\u59cb\u4f4d\u7f6e\n let startX: number = 0;\n let startY: number = 0;\n let value: number = 1;\n let x: number, y: number;\n while (loopNum--) {\n x = startX;\n y = startY;\n while (x < startX + chunkNum) {\n resArr[y][x] = value;\n x++;\n value++;\n }\n while (y < startY + chunkNum) {\n resArr[y][x] = value;\n y++;\n value++;\n }\n while (x > startX) {\n resArr[y][x] = value;\n x--;\n value++;\n }\n while (y > startY) {\n resArr[y][x] = value;\n y--;\n value++;\n }\n startX++;\n startY++;\n chunkNum -= 2;\n }\n \/\/\u5355\u72ec\u5904\u7406\u4e2d\u95f4\u7684\u6570\u5b57\n if (n % 2 === 1) {\n resArr[startX][startY] = value;\n }\n return resArr;\n};\n\n<\/code><\/pre>\n\n\n\n\u8def\u5f84\u6a21\u62df \u65b9\u5411\u53d8\u6362 <\/h3>\n\n\n\n
54. \u87ba\u65cb\u77e9\u9635 – \u529b\u6263\uff08LeetCode\uff09<\/a><\/p>\n\n\n\n\u53ef\u4ee5\u6a21\u62df\u87ba\u65cb\u77e9\u9635\u7684\u8def\u5f84\u3002\u521d\u59cb\u4f4d\u7f6e\u662f\u77e9\u9635\u7684\u5de6\u4e0a\u89d2\uff0c\u521d\u59cb\u65b9\u5411\u662f\u5411\u53f3\uff0c\u5f53\u8def\u5f84\u8d85\u51fa\u754c\u9650\u6216\u8005\u8fdb\u5165\u4e4b\u524d\u8bbf\u95ee\u8fc7\u7684\u4f4d\u7f6e\u65f6\uff0c\u987a\u65f6\u9488\u65cb\u8f6c\uff0c\u8fdb\u5165\u4e0b\u4e00\u4e2a\u65b9\u5411<\/p>\n\n\n\n
\u5224\u65ad\u8def\u5f84\u662f\u5426\u8fdb\u5165\u4e4b\u524d\u8bbf\u95ee\u8fc7\u7684\u4f4d\u7f6e\u9700\u8981\u4f7f\u7528\u4e00\u4e2a\u4e0e\u8f93\u5165\u77e9\u9635\u5927\u5c0f\u76f8\u540c\u7684\u8f85\u52a9\u77e9\u9635 visited\uff0c\u5176\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u8868\u793a\u8be5\u4f4d\u7f6e\u662f\u5426\u88ab\u8bbf\u95ee\u8fc7\u3002\u5f53\u4e00\u4e2a\u5143\u7d20\u88ab\u8bbf\u95ee\u65f6\uff0c\u5c06 visited \u4e2d\u7684\u5bf9\u5e94\u4f4d\u7f6e\u7684\u5143\u7d20\u8bbe\u4e3a\u5df2\u8bbf\u95ee<\/p>\n\n\n\n
\u5982\u4f55\u5224\u65ad\u8def\u5f84\u662f\u5426\u7ed3\u675f\uff1f\u7531\u4e8e\u77e9\u9635\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u90fd\u88ab\u8bbf\u95ee\u4e00\u6b21\uff0c\u56e0\u6b64\u8def\u5f84\u7684\u957f\u5ea6\u5373\u4e3a\u77e9\u9635\u4e2d\u7684\u5143\u7d20\u6570\u91cf\uff0c\u5f53\u8def\u5f84\u7684\u957f\u5ea6\u8fbe\u5230\u77e9\u9635\u4e2d\u7684\u5143\u7d20\u6570\u91cf\u65f6\u5373\u4e3a\u5b8c\u6574\u8def\u5f84\uff0c\u5c06\u8be5\u8def\u5f84\u8fd4\u56de<\/p>\n\n\n\n
\u4ee3\u7801\u6ce8\u91ca\u5f88\u6e05\u6670!<\/p>\n\n\n\n
function spiralOrder(matrix: number[][]): number[] {\n \/\/\u7279\u6b8a\u60c5\u51b5\u5904\u7406\n if (!matrix.length || !matrix[0].length) {\n return []\n }\n const rows: number = matrix.length \/\/\u77e9\u9635\u884c\u6570\n const columns: number = matrix[0].length\/\/\u77e9\u9635\u5217\u6570\n\n \/\/\u8f85\u52a9\u77e9\u9635 visited\uff0c\u5176\u4e2d\u7684\u6bcf\u4e2a\u5143\u7d20\u8868\u793a\u8be5\u4f4d\u7f6e\u662f\u5426\u88ab\u8bbf\u95ee\u8fc7\n const visited: boolean[][] = new Array(rows).fill(false).map(() => new Array(columns).fill(false))\n const total: number = rows * columns \/\/\u77e9\u9635\u5143\u7d20\u603b\u6570\n const order: number[] = new Array(total).fill(0)\/\/\u7ed3\u679c\u6570\u7ec4\n let directionIndex: number = 0\/\/\u8def\u5f84\u65b9\u5411\n let row: number = 0\n let column: number = 0\n \n \/\/\u5404\u4e2a\u65b9\u5411\u8def\u5f84\u5bf9\u5e94\u7684\u6a2a\u7eb5\u5750\u6807\u53d8\u5316\u60c5\u51b5\n const directions: [number, number][] = [[0, 1], [1, 0], [0, -1], [-1, 0]] \n \n for (let i = 0; i < total; i++) { \n order[i] = matrix[row][column] \n visited[row][column] = true \/\/\u5df2\u8bbf\u95ee\n \n \/\/\u5728\u5f53\u524d\u79fb\u52a8\u8def\u5f84\u60c5\u51b5\u4e0b\u7684\u4e0b\u4e00\u884c \u4e0e \u4e0b\u4e00\u5217 \u7528\u4e8e\u540e\u7eed\u5224\u65ad\u662f\u5426\u8d8a\u754c\/\u6539\u53d8\u65b9\u5411\n const nextRow: number = row + directions[directionIndex][0] \n const nextColumn: number = column + directions[directionIndex][1]\n \n \n if (nextRow < 0 || nextRow >= rows || \n nextColumn < 0 || nextColumn >= columns || \n visited[nextRow][nextColumn]) {\n directionIndex = (directionIndex + 1) % 4\n }\n \/\/\u5f53\u524d\u8def\u5f84\u7684\u4e0b\u4e00\u884c \u4e0b\u4e00\u5217\n row += directions[directionIndex][0] \n column += directions[directionIndex][1]\n }\n return order\n}<\/code><\/pre>\n\n\n\n\u524d\u7f00\u548c \u533a\u95f4\u548c<\/h3>\n\n\n\n
\u9898\u76ee\u94fe\u63a5<\/p>\n\n\n\n
https:\/\/kamacoder.com\/problempage.php?pid=1070<\/a><\/p>\n\n\n\n\u666e\u901a\u505a\u6cd5\u4f1a\u8d85\u65f6! \u8981\u4f7f\u7528\u524d\u7f00\u548c!<\/p>\n\n\n\n
\u524d\u7f00\u548c\u7684\u601d\u60f3\u662f\u91cd\u590d\u5229\u7528\u8ba1\u7b97\u8fc7\u7684\u5b50\u6570\u7ec4\u4e4b\u548c<\/strong>\uff0c\u4ece\u800c\u964d\u4f4e\u533a\u95f4\u67e5\u8be2\u9700\u8981\u7d2f\u52a0\u8ba1\u7b97\u7684\u6b21\u6570<\/p>\n\n\n\n\u524d\u7f00\u548c \u5728\u6d89\u53ca\u8ba1\u7b97\u533a\u95f4\u548c\u7684\u95ee\u9898\u65f6\u975e\u5e38\u6709\u7528<\/strong>\uff01<\/p>\n\n\n\n\u5982\u8ba1\u7b97 \u4e0b\u68072-5\u7684\u6570\u7ec4\u5143\u7d20\u548c \u5982\u56fe\u793a<\/p>\n\n\n\n<\/div><\/figure>\n\n\n\nC++\u4ee3\u7801 \u9762\u5bf9\u5927\u91cf\u6570\u636e \u8bfb\u53d6 \u8f93\u51fa\u64cd\u4f5c\uff0c\u6700\u597d\u7528scanf \u548c printf\uff0c\u8017\u65f6\u4f1a\u5c0f\u5f88\u591a<\/strong><\/p>\n\n\n\n#include <iostream>\n#include <vector>\nusing namespace std;\nint main() {\n int n, a, b;\n cin >> n;\n vector<int> vec(n);\n vector<int> p(n);\n int presum = 0;\n for (int i = 0; i < n; i++) {\n scanf(\"%d\", &vec[i]);\n presum += vec[i];\n p[i] = presum;\n }\n\n while (~scanf(\"%d%d\", &a, &b)) {\n int sum;\n if (a == 0) sum = p[b];\n else sum = p[b] - p[a - 1];\n printf(\"%d\\n\", sum);\n }\n}\n<\/code><\/pre>\n\n\n\nJS(Node)\u7248\u672c\u4ee3\u7801<\/strong><\/p>\n\n\n\n\u6b63\u597d\u901a\u8fc7\u8fd9\u4e2a\u5b66\u4e60\u4e00\u4e0bNode \u8fd8\u6709ACM\/\u9762\u8bd5\u6a21\u5f0f!<\/p>\n\n\n\n
\n\u4e4b\u524d\u8fd8\u4e0d\u77e5\u9053JS\u600e\u4e48\u5b9e\u73b0\u952e\u76d8\u5f55\u5165 (\u6276\u989d\u82e6\u7b11 \u5475\u5475\u5475\u54c8\u54c8\u54c8) <\/p>\n<\/div>\n\n\n\n
\u6ce8\u91ca\u62c9\u6ee1!<\/p>\n\n\n\n
\/\/ \u5f15\u5165Node.js\u5185\u7f6e\u7684readline\u6a21\u5757\uff0c\u7528\u4e8e\u9010\u884c\u8bfb\u53d6\u8f93\u5165\nconst readline = require('readline'); \n\n\/\/ \u521b\u5efareadline\u63a5\u53e3\u5b9e\u4f8b\uff0c\u914d\u7f6e\u8f93\u5165\u8f93\u51fa\u6d41\nconst rl = readline.createInterface({\n input: process.stdin, \/\/ \u6807\u51c6\u8f93\u5165\uff08\u952e\u76d8\u8f93\u5165\uff09\n output: process.stdout \/\/ \u6807\u51c6\u8f93\u51fa\uff08\u63a7\u5236\u53f0\u8f93\u51fa\uff09\n});\n\nlet n = 0; \/\/\u6570\u7ec4\u957f\u5ea6\nlet array = []; \/\/\u88ab\u67e5\u8be2\u7684\u6570\u7ec4\nlet queries = []; \/\/\u67e5\u8be2\u7684\u6570\u7ec4 \u8bb0\u5f55\u67e5\u8be2\u5de6\u53f3\u8fb9\u754c\nlet lineCount = 0; \/\/\u7528lineCount\u5224\u65ad\u8f93\u5165\u5185\u5bb9\n\n\/\/ \u76d1\u542c'line'\u4e8b\u4ef6\uff1a\u6bcf\u5f53\u7528\u6237\u8f93\u5165\u4e00\u884c\u5e76\u6309\u56de\u8f66\u65f6\u89e6\u53d1\nrl.on('line', (line) => {\n if (lineCount === 0) {\n \/\/\u7b2c\u4e00\u6b21\u8f93\u5165 \u662fn\u7684\u503c\n n = parseInt(line);\n lineCount++;\n } else if (lineCount <= n) {\n \/\/\u540e\u9762\u7684n\u4e2a\u6570 \u662f\u6570\u7ec4\u5143\u7d20\u503c\n array.push(parseInt(line));\n lineCount++;\n } else {\n \/\/\u6700\u540e\u7684\u8f93\u5165\u662f\u67e5\u8be2\u8fb9\u754c\n const [a, b] = line.trim().split(' ').map(Number);\n queries.push([a, b]);\n }\n});\n\n\/\/\u76d1\u542c'close'\u4e8b\u4ef6\uff1a\u5f53\u8f93\u5165\u7ed3\u675f\u65f6\u89e6\u53d1\uff08\u901a\u5e38\u662f\u6309Ctrl+C\u6216\u8f93\u5165\u6d41\u5173\u95ed\uff09\nrl.on('close', () => {\n \/\/ \u6784\u5efa\u524d\u7f00\u548c\u6570\u7ec4\n const prefix = new Array(n + 1).fill(0);\n for (let i = 0; i < n; i++) {\n prefix[i + 1] = prefix[i] + array[i];\n }\n\n \/\/ \u5904\u7406\u6bcf\u4e2a\u67e5\u8be2\n for (const [a, b] of queries) {\n \/\/\u6ce8\u610f\u8fb9\u754c\u7684\u8c03\u6574\n const sum = prefix[b + 1] - prefix[a];\n console.log(sum);\n }\n});<\/code><\/pre>\n\n\n\n\u4e8c\u7ef4\u524d\u7f00\u548c \u5f00\u53d1\u5546\u8d2d\u4e70\u571f\u5730 <\/h3>\n\n\n\n
44. \u5f00\u53d1\u5546\u8d2d\u4e70\u571f\u5730\uff08\u7b2c\u4e94\u671f\u6a21\u62df\u7b14\u8bd5\uff09<\/a><\/p>\n\n\n\n\u57fa\u672c\u601d\u60f3\u7c7b\u4f3c\u4e8e\u666e\u901a\u7684\u524d\u7f00\u548c \u4e0d\u8fc7\u8fd9\u91cc\u662f\u4e8c\u7ef4\u60c5\u51b5 <\/p>\n\n\n\n
JS\u4ee3\u7801\u5982\u4e0b<\/p>\n\n\n\n
const readline = require('readline');\n\nconst rl = readline.createInterface({\n input: process.stdin,\n output: process.stdout\n});\n\nlet n, m;\nlet s = [];\nlet data = [];\nlet lineCount = 0;\n\nrl.on('line', (line) => {\n if (lineCount === 0) {\n [n, m] = line.trim().split(' ').map(Number);\n s = Array.from({ length: n + 1 }, () => new Array(m + 1).fill(0));\n lineCount++;\n } else {\n data.push(line.trim().split(' ').map(Number));\n \n if (data.length === n) {\n \/\/ \u6784\u5efa\u4e8c\u7ef4\u524d\u7f00\u548c\u6570\u7ec4\n for (let i = 1; i <= n; i++) {\n for (let j = 1; j <= m; j++) {\n s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + data[i - 1][j - 1];\n }\n }\n \n let ans = 1e9;\n \n \/\/ \u6c34\u5e73\u5207\u5272\n for (let i = 1; i < n; i++) {\n let x = Math.abs(s[n][m] - 2 * s[i][m]);\n ans = Math.min(ans, x);\n }\n \n \/\/ \u5782\u76f4\u5207\u5272\n for (let i = 1; i < m; i++) {\n let x = Math.abs(s[n][m] - 2 * s[n][i]);\n ans = Math.min(ans, x);\n }\n \n console.log(ans);\n rl.close();\n }\n }\n});<\/code><\/pre>\n\n\n\n\u5173\u952e\u4ee3\u7801\u5982\u4e0b \u662f\u6784\u5efa\u4e8c\u7ef4\u524d\u7f00\u548c\u6570\u7ec4\u7684\u5173\u952e!<\/p>\n\n\n\n
s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + data[i - 1][j - 1];<\/strong><\/code><\/pre>\n\n\n\n\u603b\u7ed3<\/h3>\n\n\n\n
\u6570\u7ec4\u6a21\u5757\u4e3b\u8981\u5b66\u4e60\u4e86\u4ee5\u4e0b\u51e0\u4e2a\u65b9\u6cd5<\/p>\n\n\n\n
1.\u4e8c\u5206\u67e5\u627e<\/p>\n\n\n\n
2.\u53cc\u6307\u9488<\/p>\n\n\n\n
3.\u6ed1\u52a8\u7a97\u53e3<\/p>\n\n\n\n
4.\u524d\u7f00\u548c<\/p>\n\n\n\n
\u4e5f\u901a\u8fc7\u540e\u9762\u4e24\u4e2a\u9898\u76ee\u5b66\u4e60\u5230Node\u73af\u5883\u4e0b\u5199\u7b97\u6cd5\u7684\u4e00\u4e9b\u5904\u7406\u65b9\u5f0f<\/p>\n\n\n\n
\u94fe\u8868<\/h2>\n\n\n\n
\u8fd9\u4e00\u5757\u4e3b\u8981\u8981\u5b66\u4e60\u7684\u4e0d\u4ec5\u662f\u95ee\u9898\u7684\u89e3\u51b3 \u8fd8\u6709\u5982\u4f55\u7528JS\u6765\u5b9e\u73b0\u6570\u636e\u7ed3\u6784 (\u4e4b\u524d\u90fd\u662f\u7528C\/C++\u5b9e\u73b0\u7684)<\/p>\n\n\n\n
\u79fb\u9664\u94fe\u8868\u5143\u7d20 \u5c0f\u8bd5\u725b\u5200<\/h3>\n\n\n\n
\u5f88\u7b80\u5355 \u5c31\u662f\u7528JS\u5199\u94fe\u8868\u9898\u6709\u70b9\u964c\u751f……<\/p>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\nvar removeElements = function(head, val) {\n let ret = new ListNode(0, head);\n let curr = ret;\n while (curr.next) {\n if (curr.next.val === val) {\n curr.next = curr.next.next;\n \/\/ \u8fd9\u91cc\u4e0d\u79fb\u52a8curr\uff0c\u4ee5\u4fbf\u68c0\u67e5\u65b0\u7684curr.next\n } else {\n curr = curr.next; \/\/ \u53ea\u6709\u5f53\u4e0b\u4e00\u4e2a\u8282\u70b9\u4e0d\u9700\u8981\u5220\u9664\u65f6\u624d\u79fb\u52a8\n }\n }\n return ret.next;\n};<\/code><\/pre>\n\n\n\n\u8bbe\u8ba1\u94fe\u8868 JS\u7684\u7c7b<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\nconstructor<\/h4>\n\n\n\n
constructor<\/code> \u662f JavaScript \u7c7b\u4e2d\u7684\u7279\u6b8a\u65b9\u6cd5<\/strong>\uff0c\u7528\u4e8e\u521b\u5efa\u548c\u521d\u59cb\u5316\u7c7b\u7684\u5b9e\u4f8b\u5bf9\u8c61<\/p>\n\n\n\n\u5f53\u4f7f\u7528 new<\/code> \u5173\u952e\u5b57\u521b\u5efa\u5b9e\u4f8b\u65f6\u81ea\u52a8\u8c03\u7528<\/strong><\/p>\n\n\n\n\u5982\u679c\u4e0d\u5199\u4f1a\u600e\u4e48\u6837?<\/p>\n\n\n\n
class ListNode {\n \/\/ \u6ca1\u6709\u5199 constructor\n}\n\n\/\/ JavaScript \u4f1a\u81ea\u52a8\u6dfb\u52a0\uff1a\n\/\/ constructor() {} \n\nconst node = new ListNode();\nconsole.log(node); \/\/ ListNode {} (\u7a7a\u5bf9\u8c61)<\/code><\/pre>\n\n\n\n\u6784\u9020\u51fd\u6570\u5199\u6cd5<\/h4>\n\n\n\n
\u539f\u6765\u7684\u5199\u6cd5<\/p>\n\n\n\n
let MyLinkedList = function() {\n this.size = 0;\n this.head = new ListNode(0);\n};<\/code><\/pre>\n\n\n\n\u7b49\u4ef7\u7684ES6 Class\u5199\u6cd5<\/p>\n\n\n\n
class MyLinkedList {\n constructor() {\n this.size = 0;\n this.head = new ListNode(0);\n }\n}<\/code><\/pre>\n\n\n\nstatic<\/h4>\n\n\n\n
static<\/code> \u5173\u952e\u5b57\u7528\u4e8e\u5b9a\u4e49\u9759\u6001\u65b9\u6cd5<\/strong> \u901a\u8fc7\u7c7b\u76f4\u63a5\u8c03\u7528 this\u6307\u5411\u7c7b\u672c\u8eab \u4e0d\u80fd\u8bbf\u95ee\u5b9e\u4f8b\u6210\u5458<\/p>\n\n\n\n\/\/ \u901a\u8fc7\u7c7b\u540d\u76f4\u63a5\u8c03\u7528\nconst list = MyLinkedList.fromArray([1, 2, 3]);<\/code><\/pre>\n\n\n\nstatic fromArray(arr) {\n \/\/ \u8fd9\u91cc\u7684 this \u6307\u5411 MyLinkedList \u7c7b\u672c\u8eab\n const list = new this(); \/\/ \u76f8\u5f53\u4e8e new MyLinkedList()\n \/\/ ...\n}\n<\/code><\/pre>\n\n\n\nclass MyLinkedList {\n constructor() {\n this.size = 0; \/\/ \u5b9e\u4f8b\u5c5e\u6027\n }\n \n static fromArray(arr) {\n console.log(this.size); \/\/ undefined\uff0c\u65e0\u6cd5\u8bbf\u95ee\u5b9e\u4f8b\u5c5e\u6027\n \/\/ \u53ea\u80fd\u8bbf\u95ee\u9759\u6001\u5c5e\u6027\u548c\u65b9\u6cd5\n }\n}<\/code><\/pre>\n\n\n\n\u5b9e\u9645\u4f7f\u7528\u793a\u4f8b<\/p>\n\n\n\n
\/\/ \u521b\u5efa\u94fe\u8868\u7684\u51e0\u79cd\u65b9\u5f0f\uff1a\n\n\/\/ 1. \u4f20\u7edf\u65b9\u5f0f\nconst list1 = new MyLinkedList();\nlist1.addAtTail(1);\nlist1.addAtTail(2);\nlist1.addAtTail(3);\n\n\/\/ 2. \u4f7f\u7528\u9759\u6001\u5de5\u5382\u65b9\u6cd5\nconst list2 = MyLinkedList.fromArray([1, 2, 3]);\n\n\/\/ \u4e24\u79cd\u65b9\u5f0f\u7ed3\u679c\u76f8\u540c\uff0c\u4f46\u7b2c\u4e8c\u79cd\u66f4\u7b80\u6d01<\/code><\/pre>\n\n\n\n\u6700\u7ec8\u5b9e\u73b0\u4ee3\u7801 \u7528ES6+\u5b9e\u73b0 \u6bd5\u7adf\u65f6\u4ee3\u5728\u8fdb\u6b65\u561b<\/p>\n\n\n\n
\/\/ \u94fe\u8868\u8282\u70b9\u7c7b\nclass ListNode {\n constructor(val = 0, next = null) {\n this.val = val;\n this.next = next;\n }\n}\n\n\/\/ \u94fe\u8868\u7c7b\nclass MyLinkedList {\n constructor() {\n this.size = 0;\n this.head = new ListNode(0); \/\/ \u865a\u62df\u5934\u8282\u70b9\n }\n\n \/\/ \u83b7\u53d6\u6307\u5b9a\u4f4d\u7f6e\u7684\u8282\u70b9\u503c\n get(index) {\n if (index < 0 || index >= this.size) {\n return -1;\n }\n \n let current = this.head;\n for (let i = 0; i <= index; i++) {\n current = current.next;\n }\n return current.val;\n }\n\n \/\/ \u5728\u5934\u90e8\u6dfb\u52a0\u8282\u70b9\n addAtHead(val) {\n this.addAtIndex(0, val);\n }\n\n \/\/ \u5728\u5c3e\u90e8\u6dfb\u52a0\u8282\u70b9\n addAtTail(val) {\n this.addAtIndex(this.size, val);\n }\n\n \/\/ \u5728\u6307\u5b9a\u4f4d\u7f6e\u6dfb\u52a0\u8282\u70b9\n addAtIndex(index, val) {\n if (index > this.size) return;\n \n index = Math.max(0, index); \/\/ \u5904\u7406\u8d1f\u7d22\u5f15\n \n let prev = this.head;\n for (let i = 0; i < index; i++) {\n prev = prev.next;\n }\n \n const newNode = new ListNode(val, prev.next);\n prev.next = newNode;\n this.size++;\n }\n\n \/\/ \u5220\u9664\u6307\u5b9a\u4f4d\u7f6e\u7684\u8282\u70b9\n deleteAtIndex(index) {\n if (index < 0 || index >= this.size) return;\n \n let prev = this.head;\n for (let i = 0; i < index; i++) {\n prev = prev.next;\n }\n \n prev.next = prev.next.next;\n this.size--;\n }\n\n \/\/ \u53ef\u9009\uff1a\u8f6c\u6362\u4e3a\u6570\u7ec4\uff08\u4fbf\u4e8e\u8c03\u8bd5\u548c\u6d4b\u8bd5\uff09\n toArray() {\n const result = [];\n let current = this.head.next;\n while (current !== null) {\n result.push(current.val);\n current = current.next;\n }\n return result;\n }\n\n \/\/ \u53ef\u9009\uff1a\u4ece\u6570\u7ec4\u521b\u5efa\u94fe\u8868\uff08\u9759\u6001\u5de5\u5382\u65b9\u6cd5\uff09\n static fromArray(arr) {\n const list = new MyLinkedList();\n arr.forEach(val => list.addAtTail(val));\n return list;\n }\n\n \/\/ \u53ef\u9009\uff1a\u6253\u5370\u94fe\u8868\uff08\u8c03\u8bd5\u7528\uff09\n print() {\n console.log(this.toArray().join(' -> '));\n }\n}\n\n\/\/ \u4f7f\u7528\u793a\u4f8b\nconst list = new MyLinkedList();\nlist.addAtHead(1);\nlist.addAtTail(3);\nlist.addAtIndex(1, 2); \/\/ \u94fe\u8868: 1 -> 2 -> 3\nconsole.log(list.get(1)); \/\/ 2\nlist.deleteAtIndex(1); \/\/ \u94fe\u8868: 1 -> 3\nconsole.log(list.get(1)); \/\/ 3\n\n\/\/ \u4f7f\u7528\u9759\u6001\u5de5\u5382\u65b9\u6cd5\nconst list2 = MyLinkedList.fromArray([4, 5, 6]);\nlist2.print(); \/\/ 4 -> 5 -> 6<\/code><\/pre>\n\n\n\n\u53cd\u8f6c\u94fe\u8868 \u53cc\u6307\u9488 or \u9012\u5f52<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u53cc\u6307\u9488<\/p>\n\n\n\n
\u793a\u610f\u56fe:<\/p>\n\n\n\n
https:\/\/pic.leetcode-cn.com\/1631933586-mEtOBg-008eGmZEly1gnrf1oboupg30gy0c44qp.gif<\/a><\/p>\n\n\n\n\/\/ \u53cc\u6307\u9488\uff1a\nvar reverseList = function(head) {\n if(!head || !head.next) return head;\n let temp = null, pre = null, cur = head;\n while(cur) {\n temp = cur.next;\n cur.next = pre;\n pre = cur;\n cur = temp;\n }\n \/\/ temp = cur = null;\n return pre;\n};\n<\/code><\/pre>\n\n\n\n\u9012\u5f52\u89e3\u51b3<\/p>\n\n\n\n
\/\/ \u9012\u5f52\uff1a\nvar reverse = function(pre, head) {\n if(!head) return pre;\n const temp = head.next;\n head.next = pre;\n pre = head\n return reverse(pre, temp);\n}\n\nvar reverseList = function(head) {\n return reverse(null, head);\n};\n<\/code><\/pre>\n\n\n\n\u4e24\u4e24\u4ea4\u6362\u94fe\u8868\u4e2d\u7684\u8282\u70b9<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u628a\u903b\u8f91\u641e\u6e05\u695a\u5373\u53ef!<\/p>\n\n\n\n
(dummy : \u865a\u62df\u8282\u70b9)<\/p>\n\n\n\n
var swapPairs = function (head) {\n const dummy = new ListNode(0, head);\n let current = dummy;\n \n while (current.next && current.next.next) {\n \/\/\u5faa\u73af\u6761\u4ef6\u4e0d\u80fd\u4ea4\u6362\u4f4d\u7f6e\n \/\/\u56e0\u4e3a\u5fc5\u987b\u5148\u68c0\u67e5temp.next\u5b58\u5728\uff0c\u624d\u80fd\u5b89\u5168\u5730\u8bbf\u95eetemp.next.next\n const first = current.next;\n const second = current.next.next;\n \n \/\/ \u4ea4\u6362\u8282\u70b9\n first.next = second.next;\n second.next = first;\n current.next = second;\n \n \/\/ \u79fb\u52a8\u5230\u4e0b\u4e00\u5bf9\u7684\u524d\u4e00\u4e2a\u8282\u70b9\n current = first;\n }\n \n return dummy.next;\n};<\/code><\/pre>\n\n\n\n\u9012\u5f52\u7248\u672c<\/strong>
var swapPairs = function (head) {
if (head == null || head.next == null) {
return head;
}
let after = head.next;
head.next = swapPairs(after.next);
after.next = head;
return after;
};<\/p>\n\n\n\n\u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2cN\u4e2a\u7ed3\u70b9 \u5feb\u6162\u6307\u9488<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u9996\u5148\u8fd9\u91cc\u6211\u63a8\u8350\u5927\u5bb6\u4f7f\u7528\u865a\u62df\u5934\u7ed3\u70b9<\/strong>\uff0c\u8fd9\u6837\u65b9\u4fbf\u5904\u7406\u5220\u9664\u5b9e\u9645\u5934\u7ed3\u70b9\u7684\u903b\u8f91<\/strong>\uff0c\u5982\u679c\u865a\u62df\u5934\u7ed3\u70b9\u4e0d\u6e05\u695a\uff0c\u53ef\u4ee5\u770b\u8fd9\u7bc7\uff1a \u94fe\u8868\uff1a\u542c\u8bf4\u7528\u865a\u62df\u5934\u8282\u70b9\u4f1a\u65b9\u4fbf\u5f88\u591a\uff1f<\/a><\/p>\n\n\n\n\u5220\u9664\u4e00\u4e2a\u7ed3\u70b9 \u9700\u8981\u627e\u5230\u8fd9\u4e2a\u7ed3\u70b9\u7684\u524d\u4e00\u4e2a\u7ed3\u70b9!<\/strong><\/p>\n\n\n\n\u82e5\u6ca1\u6709\u865a\u62df\u5934\u7ed3\u70b9 \u5219\u5220\u9664\u5934\u7ed3\u70b9\u64cd\u4f5c\u9700\u8981\u5355\u72ec\u5904\u7406!<\/strong> <\/p>\n\n\n\nvar removeNthFromEnd = function (head, n) {\n \/\/ \u521b\u5efa\u54e8\u5175\u8282\u70b9\uff0c\u7b80\u5316\u89e3\u9898\u903b\u8f91\n let dummy = new ListNode(0,head)\n let fast = dummy\n let slow = dummy\n while(n--){\n fast = fast.next\n }\n while(fast.next){\n fast = fast.next\n slow = slow.next\n }\n slow.next = slow.next.next\n return dummy.next\n}<\/code><\/pre>\n\n\n\n\u94fe\u8868\u76f8\u4ea4 \u5148\u8d70\u4e00\u6b65 \u89e3\u6784\u8d4b\u503c\u4ea4\u6362\u6570\u636e<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u770b\u5982\u4e0b\u4e24\u4e2a\u94fe\u8868\uff0c\u76ee\u524dcurA\u6307\u5411\u94fe\u8868A\u7684\u5934\u7ed3\u70b9\uff0ccurB\u6307\u5411\u94fe\u8868B\u7684\u5934\u7ed3\u70b9\uff1a<\/p>\n\n\n\n<\/div><\/figure>\n\n\n\n\u6211\u4eec\u6c42\u51fa\u4e24\u4e2a\u94fe\u8868\u7684\u957f\u5ea6\uff0c\u5e76\u6c42\u51fa\u4e24\u4e2a\u94fe\u8868\u957f\u5ea6\u7684\u5dee\u503c\uff0c\u7136\u540e\u8ba9curA\u79fb\u52a8\u5230\uff0c\u548ccurB \u672b\u5c3e\u5bf9\u9f50\u7684\u4f4d\u7f6e\uff0c\u5982\u56fe\uff1a<\/p>\n\n\n\n<\/div><\/figure>\n\n\n\n\u6b64\u65f6\u6211\u4eec\u5c31\u53ef\u4ee5\u6bd4\u8f83curA\u548ccurB\u662f\u5426\u76f8\u540c\uff0c\u5982\u679c\u4e0d\u76f8\u540c\uff0c\u540c\u65f6\u5411\u540e\u79fb\u52a8curA\u548ccurB\uff0c\u5982\u679c\u9047\u5230curA == curB\uff0c\u5219\u627e\u5230\u4ea4\u70b9<\/p>\n\n\n\n
\u5426\u5219\u5faa\u73af\u9000\u51fa\u8fd4\u56de\u7a7a\u6307\u9488<\/p>\n\n\n\n
var getListLen = function(head) {\n let len = 0, cur = head;\n while(cur) {\n len++;\n cur = cur.next;\n }\n return len;\n}\nvar getIntersectionNode = function(headA, headB) {\n let curA = headA,curB = headB,\n lenA = getListLen(headA), \/\/ \u6c42\u94fe\u8868A\u7684\u957f\u5ea6\n lenB = getListLen(headB); \n if(lenA < lenB) { \/\/ \u8ba9curA\u4e3a\u6700\u957f\u94fe\u8868\u7684\u5934\uff0clenA\u4e3a\u5176\u957f\u5ea6\n \n \/\/ \u4ea4\u6362\u53d8\u91cf\u6ce8\u610f\u52a0 \u201c\u5206\u53f7\u201d \uff0c\u4e24\u4e2a\u6570\u7ec4\u4ea4\u6362\u53d8\u91cf\u5728\u540c\u4e00\u4e2a\u4f5c\u7528\u57df\u4e0b\u65f6\n \/\/ \u5982\u679c\u4e0d\u52a0\u5206\u53f7\uff0c\u4e0b\u9762\u4e24\u6761\u4ee3\u7801\u7b49\u540c\u4e8e\u4e00\u6761\u4ee3\u7801: [curA, curB] = [lenB, lenA]\n \n [curA, curB] = [curB, curA];\n [lenA, lenB] = [lenB, lenA];\n }\n let i = lenA - lenB; \/\/ \u6c42\u957f\u5ea6\u5dee\n while(i-- > 0) { \/\/ \u8ba9curA\u548ccurB\u5728\u540c\u4e00\u8d77\u70b9\u4e0a\uff08\u672b\u5c3e\u4f4d\u7f6e\u5bf9\u9f50\uff09\n curA = curA.next;\n }\n while(curA && curA !== curB) { \/\/ \u904d\u5386curA \u548c curB\uff0c\u9047\u5230\u76f8\u540c\u5219\u76f4\u63a5\u8fd4\u56de\n curA = curA.next;\n curB = curB.next;\n }\n return curA;\n};<\/code><\/pre>\n\n\n\n\u6ce8\u610f\u8fd9\u91cc\u7684\u64cd\u4f5c!<\/strong><\/p>\n\n\n\n[curA, curB] = [curB, curA];\n[lenA, lenB] = [lenB, lenA];<\/code><\/pre>\n\n\n\n\u8fd9\u91cc\u662f\u5229\u7528\u89e3\u6784\u8d4b\u503c<\/strong>\u8fdb\u884c\u6570\u636e\u4ea4\u6362 \u56fa\u5b9acurA\u4e3a\u6700\u957f\u94fe\u8868\u7684\u5934\uff0clenA\u4e3a\u5176\u957f\u5ea6<\/p>\n\n\n\n\u4f20\u7edf\u65b9\u6cd5\u4f7f\u7528temp\u4f5c\u4e3a\u4e2d\u95f4\u53d8\u91cf \u5f88\u4e0d\u7f8e\u89c2<\/p>\n\n\n\n
\u8fd9\u79cd\u5199\u6cd5\u4f7f\u7528\u4e86 ES6 \u7684\u89e3\u6784\u8d4b\u503c\uff08Destructuring Assignment\uff09<\/strong>\uff0c\u5b83\u6bd4\u4f20\u7edf\u7684 temp<\/code> \u4e2d\u95f4\u53d8\u91cf\u65b9\u6cd5\u66f4\u52a0\u7b80\u6d01\u548c\u4f18\u96c5<\/strong><\/p>\n\n\n\n\u5de5\u4f5c\u539f\u7406\u76f8\u5f53\u4e8e\u521b\u5efa\u4e86\u4e00\u4e2a\u4e34\u65f6\u6570\u7ec4tempArray<\/p>\n\n\n\n
\/\/ \u76f8\u5f53\u4e8e\uff1a\nlet tempArray = [bLen, aLen];\naLen = tempArray[0]; \/\/ \u7b2c\u4e00\u4e2a\u503c\u8d4b\u7ed9 aLen\nbLen = tempArray[1]; \/\/ \u7b2c\u4e8c\u4e2a\u503c\u8d4b\u7ed9 bLen\n\n\/\/ \u4f46\u5f15\u64ce\u4f1a\u4f18\u5316\u8fd9\u4e2a\u8fc7\u7a0b\uff0c\u4e0d\u4f1a\u771f\u7684\u521b\u5efa\u4e34\u65f6\u6570\u7ec4\n\/\/ \u5fc5\u987b\u8981\u52a0\u5206\u53f7! \u5426\u5219\u76f8\u5f53\u4e8e[curA, curB] = [curB, curA][lenA, lenB] = [lenB, lenA] \n\/\/ \u8fd9\u4e0d\u662f\u6211\u4eec\u60f3\u8981\u7684\u6548\u679c!\n<\/code><\/pre>\n\n\n\n\u89e3\u6784\u8d4b\u503c\u7684\u5176\u4ed6\u5e94\u7528<\/p>\n\n\n\n
\/\/ \u4ea4\u6362\u591a\u4e2a\u53d8\u91cf\n[a, b, c] = [c, a, b];\n\n\/\/ \u51fd\u6570\u8fd4\u56de\u591a\u4e2a\u503c\nfunction getValues() { return [1, 2, 3]; }\nconst [x, y, z] = getValues();\n\n\/\/ \u5bf9\u8c61\u89e3\u6784\nconst {name, age} = person;<\/code><\/pre>\n\n\n\n\u73af\u5f62\u94fe\u8868 \u54c8\u5e0c\u8868 or \u4f9d\u65e7\u5feb\u6162\u6307\u9488<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u54c8\u5e0c\u8868<\/h4>\n\n\n\n
\u6211\u4eec\u904d\u5386\u94fe\u8868\u4e2d\u7684\u6bcf\u4e2a\u8282\u70b9\uff0c\u5e76\u5c06\u5b83\u8bb0\u5f55\u4e0b\u6765\uff1b\u4e00\u65e6\u9047\u5230\u4e86\u6b64\u524d\u904d\u5386\u8fc7\u7684\u8282\u70b9\uff0c\u5c31\u53ef\u4ee5\u5224\u5b9a\u94fe\u8868\u4e2d\u5b58\u5728\u73af \u501f\u52a9\u54c8\u5e0c\u8868\u53ef\u4ee5\u5f88\u65b9\u4fbf\u5730\u5b9e\u73b0<\/p>\n\n\n\n
\u6b64\u64cd\u4f5c\u53ef\u4ee5\u5229\u7528JS\u4e2d\u7684\u5185\u7f6e\u5bf9\u8c61Set\u8f7b\u677e\u5b9e\u73b0<\/p>\n\n\n\n
var detectCycle = function(head) {\n const visted = new Set()\n while(head!==null){\n if(visted.has(head)){\n return head\n }\n visted.add(head)\n head = head.next\n }\n return null\n}<\/code><\/pre>\n\n\n\n\u5feb\u6162\u6307\u9488<\/h4>\n\n\n\n
1.\u5224\u65ad\u94fe\u8868\u662f\u5426\u6709\u73af<\/strong><\/p>\n\n\n\n\u53ef\u4ee5\u4f7f\u7528\u5feb\u6162\u6307\u9488\u6cd5\uff0c\u5206\u522b\u5b9a\u4e49 fast \u548c slow \u6307\u9488\uff0c\u4ece\u5934\u7ed3\u70b9\u51fa\u53d1\uff0cfast\u6307\u9488\u6bcf\u6b21\u79fb\u52a8\u4e24\u4e2a\u8282\u70b9\uff0cslow\u6307\u9488\u6bcf\u6b21\u79fb\u52a8\u4e00\u4e2a\u8282\u70b9\uff0c\u5982\u679c fast \u548c slow\u6307\u9488\u5728\u9014\u4e2d\u76f8\u9047 \uff0c\u8bf4\u660e\u8fd9\u4e2a\u94fe\u8868\u6709\u73af<\/strong><\/p>\n\n\n\n\u4e3a\u4ec0\u4e48fast \u8d70\u4e24\u4e2a\u8282\u70b9\uff0cslow\u8d70\u4e00\u4e2a\u8282\u70b9\uff0c\u6709\u73af\u7684\u8bdd\uff0c\u4e00\u5b9a\u4f1a\u5728\u73af\u5185\u76f8\u9047\u5462\uff0c\u800c\u4e0d\u662f\u6c38\u8fdc\u7684\u9519\u5f00\u5462?<\/p>\n\n\n\n
\u9996\u5148\u7b2c\u4e00\u70b9\uff1afast\u6307\u9488\u4e00\u5b9a\u5148\u8fdb\u5165\u73af\u4e2d\uff0c\u5982\u679cfast\u6307\u9488\u548cslow\u6307\u9488\u76f8\u9047\u7684\u8bdd\uff0c\u4e00\u5b9a\u662f\u5728\u73af\u4e2d\u76f8\u9047\uff0c\u8fd9\u662f\u6bcb\u5eb8\u7f6e\u7591\u7684<\/strong><\/p>\n\n\n\n\u90a3\u4e48\u6765\u770b\u4e00\u4e0b\uff0c\u4e3a\u4ec0\u4e48fast\u6307\u9488\u548cslow\u6307\u9488\u4e00\u5b9a\u4f1a\u76f8\u9047\u5462\uff1f<\/strong><\/p>\n\n\n\n\u8fd9\u662f\u56e0\u4e3afast\u662f\u8d70\u4e24\u6b65\uff0cslow\u662f\u8d70\u4e00\u6b65\uff0c\u5176\u5b9e\u76f8\u5bf9\u4e8eslow\u6765\u8bf4\uff0cfast\u662f\u4e00\u4e2a\u8282\u70b9\u4e00\u4e2a\u8282\u70b9\u7684\u9760\u8fd1slow\u7684<\/strong>\uff0c\u6240\u4ee5fast\u4e00\u5b9a\u53ef\u4ee5\u548cslow\u91cd\u5408<\/p>\n\n\n\n2.\u5982\u679c\u6709\u73af \u5982\u4f55\u627e\u5230\u8fd9\u4e2a\u73af\u7684\u5165\u53e3?<\/strong><\/p>\n\n\n\n\u5982\u4e0b\u56fe\u6240\u793a\uff0c\u8bbe\u94fe\u8868\u4e2d\u73af\u5916\u90e8\u5206\u7684\u957f\u5ea6\u4e3a a\u3002slow \u6307\u9488\u8fdb\u5165\u73af\u540e\uff0c\u53c8\u8d70\u4e86 b \u7684\u8ddd\u79bb\u4e0e fast \u76f8\u9047\u3002\u6b64\u65f6\uff0cfast \u6307\u9488\u5df2\u7ecf\u8d70\u5b8c\u4e86\u73af\u7684 n \u5708\uff0c\u56e0\u6b64\u5b83\u8d70\u8fc7\u7684\u603b\u8ddd\u79bb\u4e3a a+n(b+c)+b=a+(n+1)b+nc<\/p>\n\n\n\n<\/div><\/figure>\n\n\n\n\u6839\u636e\u9898\u610f\uff0c\u4efb\u610f\u65f6\u523b\uff0cfast \u6307\u9488\u8d70\u8fc7\u7684\u8ddd\u79bb\u90fd\u4e3a slow \u6307\u9488\u7684 2 \u500d
\u56e0\u6b64\uff0c\u6211\u4eec\u6709a+(n+1)b+nc=2(a+b)\u27f9a=c+(n\u22121)(b+c)
\u6709\u4e86 a=c+(n\u22121)(b+c) \u7684\u7b49\u91cf\u5173\u7cfb\uff0c\u6211\u4eec\u4f1a\u53d1\u73b0\uff1a\u4ece\u76f8\u9047\u70b9\u5230\u5165\u73af\u70b9\u7684\u8ddd\u79bb\u52a0\u4e0a n\u22121 \u5708\u7684\u73af\u957f\uff0c\u6070\u597d\u7b49\u4e8e\u4ece\u94fe\u8868\u5934\u90e8\u5230\u5165\u73af\u70b9\u7684\u8ddd\u79bb<\/p>\n\n\n\n
var detectCycle = (head)=> {\n \/\/\u5982\u679c\u6ca1\u6709\u8282\u70b9\u6216\u8005\u53ea\u6709\u4e00\u4e2a\u8282\u70b9 \u5219\u80af\u5b9a\u65e0\u73af\n if(!head || !head.next) return null;\n \/\/\u5982\u679c\u5feb\u6162\u6307\u9488\u4e0d\u4f1a\u76f8\u9047 \u4e5f\u65e0\u73af\n let slow =head.next, fast = head.next.next;\n while(fast && fast.next && fast!== slow) {\n slow = slow.next;\n fast = fast.next.next; \n }\n if(!fast || !fast.next ) return null;\n \/\/\u5df2\u7ecf\u786e\u5b9a\u6709\u73af \u6839\u636e\u6211\u4eec\u4e4b\u524d\u7684\u5206\u6790\u53bb\u627e\u5230\u73af\u7684\u5165\u53e3\u5373\u53ef\n slow = head;\n while (fast !== slow) {\n slow = slow.next;\n fast = fast.next;\n }\n return slow;\n};\n<\/code><\/pre>\n\n\n\n\u54c8\u5e0c\u8868<\/h2>\n\n\n\n\u6709\u6548\u7684\u5b57\u6bcd\u5f02\u4f4d\u8bcd \u5bf9\u8c61hashMap or \u6570\u7ec4hashMap<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u6570\u7ec4<\/strong><\/p>\n\n\n\ncharCodeAt() \u662f JavaScript \u5b57\u7b26\u4e32\u7684\u65b9\u6cd5\uff0c\u7528\u4e8e\u83b7\u53d6\u6307\u5b9a\u4f4d\u7f6e\u5b57\u7b26\u7684 Unicode \u7f16\u7801\u503c<\/p>\n\n\n\n
\u4e3a\u4ec0\u4e48\u8981\u7528base?<\/p>\n\n\n\n
\u5982\u679c\u6ca1\u6709 base\uff0c\u4f60\u7684\u6570\u7ec4\u7d22\u5f15\u4f1a\u662f\uff1a
“a” -> 97, “b” -> 98, …, “z” -> 122
\u8fd9\u610f\u5473\u7740\u4f60\u9700\u8981\u4e00\u4e2a\u957f\u5ea6\u4e3a123\u7684\u6570\u7ec4\uff0c\u800c\u4e0d\u662f26\uff01<\/p>\n\n\n\n
var isAnagram = function(s, t) {\n if(s.length !== t.length) return false\n const base = \"a\".charCodeAt()\n const ret = new Array(26).fill(0)\n for(const char of s) {\n ret[char.charCodeAt() - base]++\n }\n \n for(const char of t){\n if(!ret[char.charCodeAt() -base])return false\n ret[char.charCodeAt() -base]--\n }\n return true\n};<\/code><\/pre>\n\n\n\n\u5bf9\u8c61<\/strong> <\/p>\n\n\n\nconst initHashMap = (len,str) =>{\n const hashMap = {}\n for(let i = 0;i<len ;i++){\n hashMap[str[i]] = (hashMap[str[i]] || 0) + 1\n }\n return hashMap\n}\n\nvar isAnagram = function(s, t) {\n if (s.length !== t.length) return false\n let len = s.length\n const mapS = initHashMap(len,s)\n const mapT = initHashMap(len,t)\n for(const char in mapS){\n if(mapS[char] !== mapT[char]){\n return false\n }\n }\n return true\n}\n<\/code><\/pre>\n\n\n\nfor…of \u4e0d\u80fd\u76f4\u63a5\u904d\u5386\u666e\u901a\u5bf9\u8c61
mapS \u662f\u4e00\u4e2a\u5bf9\u8c61\uff0c\u800c for…of \u53ea\u80fd\u7528\u4e8e\u53ef\u8fed\u4ee3\u5bf9\u8c61\uff08\u5982\u6570\u7ec4\u3001\u5b57\u7b26\u4e32\u3001Map\u3001Set\u7b49\uff09\uff0c\u4e0d\u80fd\u76f4\u63a5\u7528\u4e8e\u666e\u901a\u5bf9\u8c61
\u8981\u7528for…in \u904d\u5386\u666e\u901a\u5bf9\u8c61\u7684\u952e <\/p>\n\n\n\n
\u4e24\u4e2a\u6570\u7ec4\u7684\u4ea4\u96c6 Set\u64cd\u4f5c<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u8001\u5b9e\u4eba<\/strong><\/p>\n\n\n\nfunction intersection(nums1: number[], nums2: number[]): number[] {\n let resSet : Set<number> = new Set()\n let nums1Set : Set<number> = new Set(nums1)\n \/\/ for(const n of nums2) {\n \/\/ nums1Set.has(n) && resSet.add(n);\n \/\/ }\n \/\/ \u5faa\u73af \u6bd4 \u8fed\u4ee3\u5668\u5feb\n for (let i = nums2.length - 1; i >= 0; i--) {\n nums1Set.has(nums2[i]) && resSet.add(nums2[i]);\n }\n \/\/return [...resSet] \/\/\u5c06\u96c6\u5408\u8f6c\u6362\u4e3a\u6570\u7ec4\n return Array.from(resSet) \/\/\u5c06\u96c6\u5408\u8f6c\u6362\u4e3a\u6570\u7ec4\n\n};<\/code><\/pre>\n\n\n\n\u5c0f\u70ab\u6280<\/strong><\/p>\n\n\n\nconst intersection = (nums1: number[], nums2: number[]):number[]=> {\n return Array.from(new Set(nums1.filter(i => nums2.includes(i))))\n};<\/code><\/pre>\n\n\n\n\u5feb\u4e50\u6570 \u65e0\u9650\u5faa\u73af \u5fc5\u4f1a\u91cd\u73b0<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n<\/div><\/figure>\n\n\n\n\u89e3\u51b3\u95ee\u9898\u7684\u5173\u952e\u5c31\u5728\u4e8e \u65e0\u9650\u5faa\u73af<\/strong> \u8fd9\u610f\u5473\u7740 \u5982\u679c\u4e00\u4e2a\u6570\u4e0d\u662f\u5feb\u4e50\u6570 \u4e00\u4e2a\u8fc7\u7a0b\u7684\u7ed3\u679c\u503c\u5fc5\u4f1a\u91cd\u590d!<\/strong><\/p>\n\n\n\n\u53ef\u4ee5\u6839\u636e\u8fd9\u4e2a\u6027\u8d28\u6765\u8fdb\u884c\u5224\u65ad \u5c06\u6bcf\u6b21\u7b97\u51fa\u6765\u7684\u7ed3\u679c\u653e\u5728\u4e00\u4e2aSet()\u4e2d \u5982\u679c\u91cd\u590d\u51fa\u73b0 \u5219\u8bf4\u660e \u8fd9\u4e2a\u6570\u4e0d\u662f\u5feb\u4e50\u6570!<\/p>\n\n\n\n
\u65b9\u6cd5\u4e00 \u4ee3\u6570\u6c42\u548c<\/strong><\/p>\n\n\n\nfunction calcSum(val: number): number {\n \/\/\u8ba1\u7b97\u4e00\u4e2a\u6570\u7684\u6bcf\u4e2a\u4f4d\u7f6e\u4e0a\u6570\u5b57\u7684\u5e73\u65b9\u548c\n let sum = 0 \n while(val) {\n let num = val % 10\n sum+= num**2\n val = Math.floor((val\/10))\n }\n return sum\n}\nfunction isHappy(n: number): boolean {\n let storeSet: Set<number> = new Set()\n while (n !== 1 && !storeSet.has(n)) {\n storeSet.add(n);\n n = calcSum(n);\n }\n return n === 1;\n};<\/code><\/pre>\n\n\n\n\u65b9\u6cd5\u4e8c \u8f6c\u4e3a\u5b57\u7b26\u4e32\u4f7f\u7528reduce\u6c42\u548c<\/strong><\/p>\n\n\n\n\nfunction calcSum(val: number): number {\n \/\/\u8ba1\u7b97\u4e00\u4e2a\u6570\u7684\u6bcf\u4e2a\u4f4d\u7f6e\u4e0a\u6570\u5b57\u7684\u5e73\u65b9\u548c\n return String(val).split(\"\").reduce((pre, cur) => (pre + Number(cur) * Number(cur)), 0)<\/strong>\n}\n\nfunction isHappy(n: number): boolean {\n let storeSet: Set<number> = new Set()\n while (n !== 1 && !storeSet.has(n)) {\n storeSet.add(n);\n n = calcSum(n);\n }\n return n === 1;\n};<\/code><\/pre>\n\n\n\n\u7f8e\u5999!<\/strong><\/p>\n\n\n\n\u4e24\u6570\u4e4b\u548c \u7ecf\u5178\u8001\u9898 Map\u53d1\u529b<\/h3>\n\n\n\n
\u529b\u6263\u9898\u76ee\u94fe\u63a5<\/a><\/p>\n\n\n\n\u518d\u5f3a\u8c03\u4e00\u4e0b \u4ec0\u4e48\u65f6\u5019\u4f7f\u7528\u54c8\u5e0c\u6cd5<\/strong>\uff0c\u5f53\u6211\u4eec\u9700\u8981\u67e5\u8be2\u4e00\u4e2a\u5143\u7d20\u662f\u5426\u51fa\u73b0\u8fc7\uff0c\u6216\u8005\u4e00\u4e2a\u5143\u7d20\u662f\u5426\u5728\u96c6\u5408\u91cc\u7684\u65f6\u5019\uff0c\u5c31\u8981\u7b2c\u4e00\u65f6\u95f4\u60f3\u5230\u54c8\u5e0c\u6cd5<\/p>\n\n\n\n\u672c\u9898\uff0c\u6211\u4eec\u4e0d\u4ec5\u8981\u77e5\u9053\u5143\u7d20\u6709\u6ca1\u6709\u904d\u5386\u8fc7\uff0c\u8fd8\u8981\u77e5\u9053\u8fd9\u4e2a\u5143\u7d20\u5bf9\u5e94\u7684\u4e0b\u6807\uff0c\u9700\u8981\u4f7f\u7528 key value\u7ed3\u6784\u6765\u5b58\u653e\uff0ckey\u6765\u5b58\u5143\u7d20\uff0cvalue\u6765\u5b58\u4e0b\u6807\uff0c\u90a3\u4e48\u4f7f\u7528map\u6b63\u5408\u9002<\/strong><\/p>\n\n\n\nMap\u64cd\u4f5c\u4ee5\u53caMap\u548c\u5bf9\u8c61\u7684\u533a\u522b<\/h4>\n\n\n\n
Map\u7684\u57fa\u672c\u64cd\u4f5c<\/strong><\/p>\n\n\n\nconst map = new Map();\n\n\/\/ \u6dfb\u52a0\/\u8bbe\u7f6e\u5143\u7d20\nmap.set('name', 'John');\nmap.set(1, 'number one');\nmap.set({id: 1}, 'object key');\n\n\/\/ \u83b7\u53d6\u5143\u7d20\nmap.get('name'); \/\/ 'John'\nmap.get('nonexistent'); \/\/ undefined\n\n\/\/ \u68c0\u67e5\u662f\u5426\u5b58\u5728\nmap.has('name'); \/\/ true\n\n\/\/ \u5220\u9664\u5143\u7d20\nmap.delete('name');\n\n\/\/ \u6e05\u7a7a Map\nmap.clear();\n\n\/\/ \u83b7\u53d6\u5143\u7d20\u6570\u91cf\nmap.size; \/\/ 0<\/code><\/pre>\n\n\n\nMap\u7684\u904d\u5386\u64cd\u4f5c<\/strong><\/p>\n\n\n\nconst map = new Map([['a', 1], ['b', 2], ['c', 3]]); \/\/\u4f7f\u7528\u4e8c\u7ef4\u6570\u7ec4\u521b\u5efaMap\n\n\/\/ for...of \u904d\u5386\nfor (let [key, value] of map) {\n console.log(key, value);\n}\n\n\/\/ \u53ea\u904d\u5386\u952e\nfor (let key of map.keys()) {\n console.log(key);\n}\n\n\/\/ \u53ea\u904d\u5386\u503c\nfor (let value of map.values()) {\n console.log(value);\n}\n\n\/\/ \u904d\u5386\u952e\u503c\u5bf9\nfor (let [key, value] of map.entries()) {\n console.log(key, value);\n}<\/code><\/pre>\n\n\n\nMap\u7684\u8f6c\u6362\u65b9\u6cd5<\/strong><\/p>\n\n\n\nconst map = new Map([['a', 1], ['b', 2]]);\n\n\/\/ \u8f6c\u4e3a\u6570\u7ec4\nArray.from(map); \/\/ [['a', 1], ['b', 2]]\nArray.from(map.keys()); \/\/ ['a', 'b']\nArray.from(map.values()); \/\/ [1, 2]\n\n\/\/ \u8f6c\u4e3a\u5bf9\u8c61\nObject.fromEntries(map); \/\/ {a: 1, b: 2}<\/code><\/pre>\n\n\n\nMap\u4e0eObject<\/strong><\/p>\n\n\n\n\n- \u952e\u7684\u7c7b\u578b<\/strong>\uff1aMap \u7684\u952e\u53ef\u4ee5\u662f\u4efb\u4f55\u7c7b\u578b\uff0cObject \u7684\u952e\u53ea\u80fd\u662f\u5b57\u7b26\u4e32\u6216 Symbol<\/li>\n\n\n\n
- \u987a\u5e8f\u4fdd\u8bc1<\/strong>\uff1aMap \u4fdd\u6301\u63d2\u5165\u987a\u5e8f<\/li>\n\n\n\n
- \u5927\u5c0f\u83b7\u53d6<\/strong>\uff1aMap \u6709 size \u5c5e\u6027\uff0cObject \u9700\u8981\u624b\u52a8\u8ba1\u7b97<\/li>\n\n\n\n
- \u6027\u80fd<\/strong>\uff1a\u9891\u7e41\u589e\u5220\u64cd\u4f5c\u65f6 Map \u6027\u80fd\u66f4\u597d<\/li>\n<\/ul>\n\n\n\n
\u8fc7\u7a0b\u6a21\u62df<\/h4>\n\n\n\n<\/div><\/figure>\n\n\n\n<\/div><\/figure>\n\n\n\nfunction twoSum(nums: number[], target: number): number[] {\n \/\/\u5efa\u7acb\u4e00\u4e2a\u4ece\u6570\u503c\u6620\u5c04\u5230\u7d22\u5f15\u7684Map\n const valueToIndex: Map<number,number> = new Map() \n \n for(let i = 0;i<nums.length;i++){\n let element = target - nums[i] \/\/\u770b\u770b\u9700\u8981\u4ec0\u4e48\u6570\u5b57\n if(valueToIndex.get(element) !== undefined){ \/\/\u5982\u679c\u9700\u8981\u7684\u6570\u5b57\u5b58\u5728 \n return [valueToIndex.get(element),i] \/\/\u8fd4\u56de\u4e24\u4e2a\u6570\u7684\u7d22\u5f15\n } \n valueToIndex.set(nums[i],i) \/\/\u82e5\u9700\u8981\u7684\u6570\u4e0d\u5b58\u5728 \u5c31\u5c06\u5f53\u524d\u6570\u5b57\u548c\u7d22\u5f15\u5b58\u5165Map\n }\n return [] \/\/\u4e00\u76f4\u6ca1\u627e\u5230\u90a3\u5c31\u8fd4\u56de\u4e00\u4e2a\u7a7a\u6570\u7ec4\n}<\/code><\/pre>\n\n\n\n\u56db\u6570\u76f8\u52a0 II \u7a7a\u95f4\u6362\u65f6\u95f4 \u4e24\u4e24\u5206\u7ec4<\/h3>\n\n\n\n
![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2025\/09\/image-1.png\")
<\/div><\/figure>\n\n\n\n![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2025\/09\/image-2.png\")
<\/div><\/figure>\n\n\n\n![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2025\/09\/image-34.png\")
<\/div><\/figure>\n\n\n\n![\"\u9762\u8bd5\u989802.07.\u94fe\u8868\u76f8\u4ea4_2\"\/](\"https:\/\/file1.kamacoder.com\/i\/algo\/%E9%9D%A2%E8%AF%95%E9%A2%9802.07.%E9%93%BE%E8%A1%A8%E7%9B%B8%E4%BA%A4_2.png\")
<\/div><\/figure>\n\n\n\n![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2025\/09\/image-35-1024x576.png\")
<\/div><\/figure>\n\n\n\n![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2025\/09\/image-36.png\")
<\/div><\/figure>\n\n\n\n![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2025\/09\/image-38-1024x592.png\")
<\/div><\/figure>\n\n\n\n![\"\"](\"https:\/\/womeifei.cn\/wp-content\/uploads\/2025\/09\/image-39.png\")
<\/div><\/figure>\n\n\n\n