Create 001. Two Sum

Author: haibarawu

001. Two Sum

@@ -0,0 +1,30 @@
+/****
+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.
+e.g.
+Given nums = [2, 7, 11, 15], target = 9,
+Because nums[0] + nums[1] = 2 + 7 = 9,
+return [0, 1].
+****/
+
+//C++ solution:
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        
+        vector<int> result;
+        int length = sizeof(nums);
+        for(int i = 0; i < length; i++){
+            for(int j = i+1; j <= length; j++){
+                if (nums[i] + nums[j] == target) {
+                    //cout << "[" << i << "," << j << "]" << endl;
+                    result.push_back(i);
+                    result.push_back(j);
+                    return result;
+                } 
+            }
+        }
+        cout << "no match\n";
+        return result;
+    }
+};