-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdocs__algorithm__算法题__01.md.js
More file actions
1 lines (1 loc) · 2.6 KB
/
docs__algorithm__算法题__01.md.js
File metadata and controls
1 lines (1 loc) · 2.6 KB
1
(window["webpackJsonp"]=window["webpackJsonp"]||[]).push([[17],{"V/2+":function(n,e,t){"use strict";t.r(e);var a=t("q1tI"),r=t.n(a),o=t("dEAq"),l=t("H1Ra"),i=r.a.memo((n=>{n.demos;return r.a.createElement(r.a.Fragment,null,r.a.createElement(r.a.Fragment,null,r.a.createElement("div",{className:"markdown"},r.a.createElement("h2",{id:"2\u4e24\u6570\u6c42\u548c\u95ee\u9898"},r.a.createElement(o["AnchorLink"],{to:"#2\u4e24\u6570\u6c42\u548c\u95ee\u9898","aria-hidden":"true",tabIndex:-1},r.a.createElement("span",{className:"icon icon-link"})),"2.\u4e24\u6570\u6c42\u548c\u95ee\u9898"),r.a.createElement("p",null,"\u7ed9\u5b9a\u4e00\u4e2a\u6574\u6570\u6570\u7ec4 nums \u548c\u4e00\u4e2a\u76ee\u6807\u503c target\uff0c\u8bf7\u4f60\u5728\u8be5\u6570\u7ec4\u4e2d\u627e\u51fa\u548c\u4e3a\u76ee\u6807\u503c\u7684\u90a3\u4e24\u4e2a\u6574\u6570\uff0c\u5e76\u8fd4\u56de\u4ed6\u4eec\u7684\u6570\u7ec4\u4e0b\u6807"),r.a.createElement("blockquote",null,r.a.createElement("p",null,"\u793a\u4f8b\uff1a \u7ed9\u5b9a nums=[2,7,9,11],target=9,\u56e0\u4e3a nums[0]+nums[1]=target\uff0c\u6240\u4ee5\u8fd4\u56de[0,1]")),r.a.createElement("h3",{id:"\u4ee3\u7801"},r.a.createElement(o["AnchorLink"],{to:"#\u4ee3\u7801","aria-hidden":"true",tabIndex:-1},r.a.createElement("span",{className:"icon icon-link"})),"\u4ee3\u7801"),r.a.createElement(l["a"],{code:"//\u7b2c\u4e00\u79cd\u5e38\u89c1\u89e3\u6cd5 for\u5faa\u73af\u904d\u5386\u67e5\u627e\nconst addNums = function(arr, target) {\n const obj = {};\n for (let i = 0; i < arr.length; i++) {\n if (obj[target - arr[i]] !== undefined) {\n return [obj[target - arr[i]], i];\n }\n obj[arr[i]] = i;\n }\n};\n\nconsole.log(addNums([2, 7, 9, 11], 9));\n\n//\u7b2c\u4e8c\u79cd \u7a7a\u95f4\u6362\u65f6\u95f4\nconst addNums = function(arr, target) {\n const obj = new Map();\n for (let i = 0; i < arr.length; i++) {\n if (obj.has(target - arr[i])) {\n return [obj.get(target - arr[i]), i];\n }\n obj.set(arr[i], i);\n }\n};\n\nconsole.log(addNums([2, 7, 9, 11], 9));\n\n//\u53cc\u6307\u9488\u89e3\u6cd5\nconst addNums = function(arr, target) {\n let i = 0;\n let j = nums.length - 1;\n while (i < j) {\n if (nums[i] + nums[j] > target) {\n j--;\n } else if (nums[i] + nums[j] < target) {\n i++;\n } else {\n return [i, j];\n }\n }\n};\n\nconsole.log(addNums([2, 7, 9, 11], 9));",lang:"js"}))))}));e["default"]=n=>{var e=r.a.useContext(o["context"]),t=e.demos;return r.a.useEffect((()=>{var e;null!==n&&void 0!==n&&null!==(e=n.location)&&void 0!==e&&e.hash&&o["AnchorLink"].scrollToAnchor(decodeURIComponent(n.location.hash.slice(1)))}),[]),r.a.createElement(i,{demos:t})}}}]);