add the problem in the code, uodate the code to match the latest change in LeetCode

Author: Linsen Wu

C++/001_Two_Sum.cpp

@@ -1,4 +1,19 @@
-//Author: Linsen Wu
+/*
+ *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.
+
+ *Example:
+ *Given nums = [2, 7, 11, 15], target = 9,
+ *Because nums[0] + nums[1] = 2 + 7 = 9,
+ *return [0, 1].
+
+ *UPDATE (2016/2/13):
+ *The return format had been changed to zero-based indices. Please read the above updated description carefully
+
+ *Tag: Array, Hash Table
+ 
+ *Author: Linsen Wu
+*/
 
 #include "stdafx.h"
 #include "iostream"
@@ -17,10 +32,10 @@ class Solution {
 			it = index_map.find(target-numbers[i]);
 			if (it != index_map.end()) {
 				indexResults.push_back(it->second);
-				indexResults.push_back(i+1);
+				indexResults.push_back(i);
 				return indexResults;
 			} else {
-				index_map[numbers[i]] = i+1;
+				index_map[numbers[i]] = i;
 			}
 		}
 		return indexResults;