Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

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

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit80d5a60

Browse files
Add 167-Two-Sum-II.c
1 parent86f67c2 commit80d5a60

File tree

1 file changed

+28
-0
lines changed

1 file changed

+28
-0
lines changed

‎c/167-Two-Sum-II.c

Lines changed: 28 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
2+
/*
3+
Given a 1-indexed sorted int array & target:
4+
Return indices (added by 1) of 2 nums that add to target
5+
2 pointers, outside in, iterate i/j if sum is too low/high
6+
Time: O(n)
7+
Space: O(1)
8+
*/
9+
10+
int*twoSum(int*numbers,intnumbersSize,inttarget,int*returnSize){
11+
*returnSize=2;
12+
int*ans=malloc(sizeof(int)*2);
13+
14+
inti=0;
15+
intj=numbersSize-1;
16+
intk;
17+
while (true) {
18+
k=numbers[i]+numbers[j]-target;
19+
if (k==0) {// numbers[i]+numbers[j] = target
20+
ans[0]=i+1;
21+
ans[1]=j+1;
22+
returnans;
23+
}elseif (k>0)// numbers[i]+numbers[j] > target
24+
j--;
25+
else// numbers[i]+numbers[j] < target
26+
i++;
27+
}
28+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp