Leet_Code/Two_Sum.cpp at master · sudoberlin/Leet_Code · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        int i;
        int j;
        int k;
        int length;
        vector<int> indices;
        length = nums.size();

        for (i = 0; i<length; i++)
        {
            k = target - nums[i];

            for (j=i+1; j<length; j++)
            {

                if (k == nums[j])
                {
                    indices.push_back(i);
                    indices.push_back(j);
                        break;

                }
            }
            if (indices.size() == 2)
            {
                break;
            }
        }return indices;
    }
};