Skip to content

Commit 6c201a8

Browse files
committed
feat: add typescript solution to lc problem: No.0167.Two Sum II - Input array is sorted
1 parent 70c0b43 commit 6c201a8

File tree

3 files changed

+37
-0
lines changed

3 files changed

+37
-0
lines changed

solution/0100-0199/0167.Two Sum II - Input array is sorted/README.md

+14
Original file line numberDiff line numberDiff line change
@@ -96,6 +96,20 @@ class Solution {
9696
}
9797
```
9898

99+
### **TypeScript**
100+
101+
```ts
102+
function twoSum(numbers: number[], target: number): number[] {
103+
for (let right = numbers.length - 1; right >= 0; --right) {
104+
let left = numbers.indexOf(target - numbers[right]);
105+
if (left > -1 && left < right) {
106+
return [left + 1, right + 1];
107+
}
108+
}
109+
return [-1, -1];
110+
};
111+
```
112+
99113
### **C++**
100114

101115
```cpp

solution/0100-0199/0167.Two Sum II - Input array is sorted/README_EN.md

+14
Original file line numberDiff line numberDiff line change
@@ -85,6 +85,20 @@ class Solution {
8585
}
8686
```
8787

88+
### **TypeScript**
89+
90+
```ts
91+
function twoSum(numbers: number[], target: number): number[] {
92+
for (let right = numbers.length - 1; right >= 0; --right) {
93+
let left = numbers.indexOf(target - numbers[right]);
94+
if (left > -1 && left < right) {
95+
return [left + 1, right + 1];
96+
}
97+
}
98+
return [-1, -1];
99+
};
100+
```
101+
88102
### **C++**
89103

90104
```cpp
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,9 @@
1+
function twoSum(numbers: number[], target: number): number[] {
2+
for (let right = numbers.length - 1; right >= 0; --right) {
3+
let left = numbers.indexOf(target - numbers[right]);
4+
if (left > -1 && left < right) {
5+
return [left + 1, right + 1];
6+
}
7+
}
8+
return [-1, -1];
9+
};

0 commit comments

Comments
 (0)