Commit f43c086

authored

Merge pull request MisterBooo#109 from ztianming/patch-3

Update 0167-Two-Sum-II-Input-array-is-sorted.md

2 parents 20bb4de + a86c0a0 commit f43c086Copy full SHA for f43c086

File tree

1 file changed

+64

-13

lines changed

0167-Two-Sum-II-Input-array-is-sorted/Article
- 0167-Two-Sum-II-Input-array-is-sorted.md

1 file changed

+64

-13

lines changed

`‎0167-Two-Sum-II-Input-array-is-sorted/Article/0167-Two-Sum-II-Input-array-is-sorted.md‎`

Lines changed: 64 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -40,29 +40,80 @@`
`40`	`40`	`![](../Animation/Animation.gif)`
`41`	`41`
`42`	`42`	`### 代码实现`
`43`		`-`
`44`		-```
	`43`	`+#### C++`
	`44`	+```c++
`45`	`45`	`// 对撞指针`
`46`	`46`	`// 时间复杂度: O(n)`
`47`	`47`	`// 空间复杂度: O(1)`
`48`	`48`	`class Solution {`
`49`	`49`	`public:`
`50`	`50`	`vector<int> twoSum(vector<int>& numbers, int target) {`
`51`		`- int l = 0, r = numbers.size() - 1;`
`52`		`- while(l < r){`
`53`		`- if(numbers[l] + numbers[r] == target){`
`54`		`- int res[2] = {l+1, r+1};`
`55`		`- return vector<int>(res, res+2);`
	`51`	`+ int n = numbers.size();`
	`52`	`+ int left = 0;`
	`53`	`+ int right = n-1;`
	`54`	`+ while(left <= right)`
	`55`	`+ {`
	`56`	`+ if(numbers[left] + numbers[right] == target)`
	`57`	`+ {`
	`58`	`+ return {left + 1, right + 1};`
	`59`	`+ }`
	`60`	`+ else if (numbers[left] + numbers[right] > target)`
	`61`	`+ {`
	`62`	`+ right--;`
	`63`	`+ }`
	`64`	`+ else`
	`65`	`+ {`
	`66`	`+ left++;`
`56`	`67`	`}`
`57`		`- else if(numbers[l] + numbers[r] < target)`
`58`		`- l ++;`
`59`		`- else // numbers[l] + numbers[r] > target`
`60`		`- r --;`
`61`	`68`	`}`
	`69`	`+ return {-1, -1};`
`62`	`70`	`}`
`63`		`-`
`64`		`-`
	`71`	`+};`
`65`	`72`	```
	`73`	`+#### Java`
	`74`	+```java
	`75`	`+class Solution {`
	`76`	`+ public int[] twoSum(int[] numbers, int target) {`
	`77`	`+ int n = numbers.length;`
	`78`	`+ int left = 0;`
	`79`	`+ int right = n-1;`
	`80`	`+ while(left <= right)`
	`81`	`+ {`
	`82`	`+ if(numbers[left] + numbers[right] == target)`
	`83`	`+ {`
	`84`	`+ return new int[]{left + 1, right + 1};`
	`85`	`+ }`
	`86`	`+ else if (numbers[left] + numbers[right] > target)`
	`87`	`+ {`
	`88`	`+ right--;`
	`89`	`+ }`
	`90`	`+ else`
	`91`	`+ {`
	`92`	`+ left++;`
	`93`	`+ }`
	`94`	`+ }`
	`95`	`+`
	`96`	`+ return new int[]{-1, -1};`
	`97`	`+ }`
	`98`	`+}`
	`99`	+```
	`100`	`+#### Python`
	`101`	+```python
	`102`	`+class Solution(object):`
	`103`	`+ def twoSum(self, numbers, target):`
	`104`	`+ n = len(numbers)`
	`105`	`+ left,right = 0, n-1`
	`106`	`+ while left <= right:`
	`107`	`+ if numbers[left]+numbers[right] == target:`
	`108`	`+ return [left+1, right+1]`
	`109`	`+ elif numbers[left]+numbers[right] > target:`
	`110`	`+ right -=1`
	`111`	`+ else:`
	`112`	`+ left +=1`
	`113`	`+`
	`114`	`+ return [-1, -1]`
	`115`	+```
	`116`	`+`
`66`	`117`
`67`	`118`
`68`	`119`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit f43c086

File tree

1 file changed

1 file changed

`‎0167-Two-Sum-II-Input-array-is-sorted/Article/0167-Two-Sum-II-Input-array-is-sorted.md‎`

0 commit comments