Commit b134c5e

committed

add js solution to readme documents for leetcode problem: no.0001

1 parent 3e7dfab commit b134c5eCopy full SHA for b134c5e

File tree

+31

-0

lines changed

+31

-0

lines changed

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -93,6 +93,21 @@ class Solution {`
`93`	`93`	`}`
`94`	`94`	```
`95`	`95`
	`96`	`+### JavaScript`
	`97`	`+`
	`98`	+```js
	`99`	`+var twoSum = function (nums, target) {`
	`100`	`+ const map = new Map();`
	`101`	`+ for (let i = 0; i < nums.length; i++) {`
	`102`	`+ if (map.has(target - nums[i])) {`
	`103`	`+ return [map.get(target - nums[i]), i];`
	`104`	`+ }`
	`105`	`+ map.set(nums[i], i);`
	`106`	`+ }`
	`107`	`+ return [];`
	`108`	`+};`
	`109`	+```
	`110`	`+`
`96`	`111`	`### ...`
`97`	`112`
`98`	`113`	```

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -79,6 +79,21 @@ class Solution {`
`79`	`79`	`}`
`80`	`80`	```
`81`	`81`
	`82`	`+### JavaScript`
	`83`	`+`
	`84`	+```js
	`85`	`+var twoSum = function (nums, target) {`
	`86`	`+ const map = new Map();`
	`87`	`+ for (let i = 0; i < nums.length; i++) {`
	`88`	`+ if (map.has(target - nums[i])) {`
	`89`	`+ return [map.get(target - nums[i]), i];`
	`90`	`+ }`
	`91`	`+ map.set(nums[i], i);`
	`92`	`+ }`
	`93`	`+ return [];`
	`94`	`+};`
	`95`	+```
	`96`	`+`
`82`	`97`	`### ...`
`83`	`98`
`84`	`99`	```

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -40,4 +40,5 @@ var twoSum = function (nums, target) {`
`40`	`40`	`}`
`41`	`41`	`map.set(nums[i], i);`
`42`	`42`	`}`
	`43`	`+ return [];`
`43`	`44`	`};`

Comments

(0)