set up problem 001 as example. please review

Author: Linsen Wu

C++/001_Two_Sum.cpp

@@ -0,0 +1,72 @@
+//Author: Linsen Wu
+
+#include "stdafx.h"
+#include "iostream"
+#include <vector>
+#include <unordered_map>
+
+using namespace std;
+
+class Solution {
+public:
+    vector<int> twoSum(vector<int> &numbers, int target) {
+		vector<int> indexResults;
+		unordered_map<int, int> index_map;
+		unordered_map<int, int>::iterator it;
+        for (int i=0; i<numbers.size(); ++i) {
+			it = index_map.find(target-numbers[i]);
+			if (it != index_map.end()) {
+				indexResults.push_back(it->second);
+				indexResults.push_back(i+1);
+				return indexResults;
+			} else {
+				index_map[numbers[i]] = i+1;
+			}
+		}
+		return indexResults;
+    }
+};
+
+/*
+class Solution {
+public:
+    vector<int> twoSum(vector<int> &numbers, int target) {
+		vector<int> indexResults;
+        for(vector<int>::iterator iterator1 = numbers.begin(); iterator1 != numbers.end(); iterator1++)
+        {
+            for(vector<int>::iterator iterator2 = iterator1+1; iterator2 != numbers.end(); iterator2++)
+            {
+                if((*iterator1 + *iterator2) == target)
+				{
+					int index1 = iterator1 - numbers.begin() + 1;
+					int index2 = iterator2 - numbers.begin() + 1;
+					indexResults.push_back(index1);
+					indexResults.push_back(index2);
+				}
+            }
+        }
+		return indexResults;
+    }
+};*/
+
+int _tmain(int argc, _TCHAR* argv[])
+{
+	vector<int> input, output;
+	input.push_back(-1);
+	input.push_back(7);
+	input.push_back(11);
+	input.push_back(15);
+
+	Solution _solution;
+	output = _solution.twoSum(input, 6);
+
+	for(vector<int>::iterator iterator = output.begin(); iterator != output.end(); iterator++)
+		cout<<((*iterator))<<endl;
+
+	system("Pause");
+
+	return 0;
+}
+
+
+