题目描述更新：https://leetcode.com/problems/two-sum/

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read
the above updated description carefully.

Author: nujeh

C++/chapLinearList.tex

@@ -501,8 +501,8 @@ \subsubsection{代码}
         for (int i = 0; i < nums.size(); i++) {
             const int gap = target - nums[i];
             if (mapping.find(gap) != mapping.end() && mapping[gap] > i) {
-                result.push_back(i + 1);
-                result.push_back(mapping[gap] + 1);
+                result.push_back(i);
+                result.push_back(mapping[gap]);
                 break;
             }
         }