2207 - Two Sum

[nguyenanh-cs]

/* Excuse me for my broken English.

To get the given result, we need to add two values of the given vector and compare the result with the target number. To do so, we first need to have a compared value and other comparing values. So first, we will initialize two initializers i and j. i is the compared value, and j is the comparing one.

When i = 0, j = 1. These are indexes of the value in vector nums. We add these two values and compare the result with the target number. Continue through the similar process until the computer finds those that combine and equate the value to the target number. Then I return the result. */

// I know this solution will take much time and space complexity, so I have found some other solutions like Hashmap. I will learn more about this and solve this practice in another way.

/* Calculate the Time Complexity and Space Complexity Time complexity: O(n)
Space complexity: O(n^2) */

[nguyenanh-cs]

I don't know if I did all the things correctly. It's my first time on GitHub.

1_2207_Two_Sum.txt

class Solution {
public:
vector twoSum(vector& nums, int target) {
for (int i = 0; i < nums.size() - 1; i++) {
for (int j = i + 1; j < nums.size(); j++) {
if (nums[i] + nums[j] == target){
return {i, j};
}
}
}
return {};
}
};