Add LeetCode-1 (different approach) and LeetCode-167 in C++

Algorithms/Easy/167_TwoSum II/Solution.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& numbers, int target) {
+        int index1 = 0, index2 = numbers.size()-1, sum;
+        vector<int> returnVector;
+
+        while(index1 < index2) {
+            sum = numbers[index1] + numbers[index2];
+
+            if(sum == target)
+                break;
+            else if(sum < target)
+                index1++;
+            else
+                index2--;
+        }
+
+        returnVector.push_back(index1 + 1);
+        returnVector.push_back(index2 + 1);
+
+        return returnVector;
+    }
+};

Algorithms/Easy/1_TwoSum/SolutionOne.cpp

@@ -0,0 +1,33 @@
+class Solution {
+public:
+    vector<int> twoSum(vector<int>& nums, int target) {
+        vector<pair<int,int>> valueIndexPair;
+	    vector<int> returnVector;	
+	    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;
+
+        while(index1 < index2) {
+            sum = valueIndexPair[index1].first + valueIndexPair[index2].first;
+
+	        if(sum == target)
+                break;
+            else if(sum < target)
+                index1++;
+            else
+                index2--;
+        }
+
+        returnVector.push_back(valueIndexPair[index1].second);
+        returnVector.push_back(valueIndexPair[index2].second);
+
+        return returnVector;
+    }
+};