Skip to content

Add LeetCode - 121 solution in C #62

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 13 commits into from
Oct 10, 2021
Merged

Add LeetCode - 121 solution in C #62

Changes from 1 commit
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
c214f5a
Add solution to LeetCode 112
r8025n Jul 31, 2021
baab005
Merge remote-tracking branch 'upstream/main'
r8025n Jul 31, 2021
3d6d053
Address requested changes
r8025n Jul 31, 2021
8454519
resolve merge conflict
r8025n Aug 2, 2021
501f684
Add leetcode 1 (nlogn approach) and leetcode 167
r8025n Aug 2, 2021
e064a05
Merge remote-tracking branch 'upstream/main'
r8025n Aug 6, 2021
cac0d40
Merge remote-tracking branch 'upstream/main'
r8025n Aug 13, 2021
2aaa517
Address requested changes
r8025n Aug 13, 2021
42993b8
Fix indentation
r8025n Aug 13, 2021
8351c53
Merge branch 'Tahanima:main' into main
r8025n Aug 15, 2021
756c629
Merge branch 'Tahanima:main' into main
r8025n Aug 23, 2021
5f836b7
Merge branch 'Tahanima:main' into main
r8025n Sep 7, 2021
554da13
Add LeetCode 121 solution in C
r8025n Sep 7, 2021
File filter

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
Fix indentation
  • Loading branch information
@r8025n
r8025n authored Aug 13, 2021
commit 42993b8b7fff27121f90db69ae24582636f26111
12 changes: 6 additions & 6 deletions Algorithms/Easy/1_TwoSum/SolutionOne.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,22 +2,22 @@ class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
vector<pair<int, int>> valueIndexPair;
vector<int> answer;
int index1, index2, sum;
vector<int> answer;
int index1, index2, sum;

for(int k = 0; k < nums.size(); k++) {
valueIndexPair.push_back(pair<int, int>(nums[k], k));
}

sort(valueIndexPair.begin(), valueIndexPair.end());

index1 = 0;
index2 = valueIndexPair.size() - 1;
index1 = 0;
index2 = valueIndexPair.size() - 1;

while(index1 < index2) {
sum = valueIndexPair[index1].first + valueIndexPair[index2].first;

if(sum == target)
if(sum == target)
break;
else if(sum < target)
index1++;
Expand All @@ -30,4 +30,4 @@ class Solution {

return answer;
}
};
};