Two Sum

Leetcode Problem Set

Algorithm Question 1

Problem description:

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

Thinking

Two indices are required here, we can design a double loop to test each element and its neighboring elements, to find out our answer, the only one thing we need to do is adding up two testing element and judging whether their sum equals to our target value.

Code:

// write in C++
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> back;
        for (int i = 0; i < nums.size(); i++) {
            for (int j = i+1; j < nums.size(); j++) {
                    if (nums[i] + nums[j] == target) {
                        back.push_back(i);
                        back.push_back(j);
                    } else continue;
            }
        }
        return back;
    }
};

---

edited by Maoyuan, SYSU