-
Notifications
You must be signed in to change notification settings - Fork 0
/
twoSun.html
70 lines (61 loc) · 1.71 KB
/
twoSun.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
<!--
* @Author: your name
* @Date: 2020-07-08 10:46:45
* @LastEditTime: 2020-07-08 14:28:07
* @LastEditors: Please set LastEditors
* @Description: In User Settings Edit
* @FilePath: \jsQuestion\twoSun.html
-->
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8" />
<meta name="viewport" content="width=device-width, initial-scale=1.0" />
<title>Document</title>
</head>
<body></body>
</html>
<script>
/*
给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。
示例:
给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
*/
// const list = [2, 7, 11, 15, 17, 22, 21, 23];
const list = [3,2,4];
function getTwoSun(arr,num) {
let left = 0
let right = 1
let val = 0
while (left<arr.length&&right<=arr.length) {
const newVal = arr[left] + arr[right]
if(num !== newVal) {
if(right === arr.length - 1) {
left++
right = left
}
right++
}else {
console.log([left,right]);
return [left,right]
}
}
return -1
}
getTwoSun(list,6)
// function getInd(arr,num) {
// const map = new Map()
// for(let i = 0; i < arr.length ;i++) {
// const diff = num - arr[i]
// map.set(arr[i],i)
// if(map.has(diff)) {
// return [map.get(diff),i]
// }
// }
// }
// getInd(list,25)
// console.log(getInd(list,25));
</script>