We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent d6279de commit 9418c8fCopy full SHA for 9418c8f
two-sum/jun0811.js
@@ -0,0 +1,26 @@
1
+// Time Complexity : O(N^2)
2
+
3
+var twoSum = function (nums, target) {
4
+ const l = nums.length;
5
+ for (let i = 0; i < l; i++) {
6
+ for (let j = i + 1; j < l; j++) {
7
+ const value = nums[i] + nums[j];
8
+ if (value == target) return [i, j];
9
+ }
10
11
+};
12
13
+// Time Complexity : O(N)
14
15
16
+ const Map = {};
17
18
+ nums.forEach((num, idx) => {
19
+ Map[num] = idx;
20
+ });
21
22
+ for (const idx in nums) {
23
+ const value = target - nums[idx];
24
+ if (Map[value] >= 0 && Map[value] != idx) return [+idx, Map[value]];
25
26
0 commit comments