Update leetcode1两数之和.md

animation-simulation/数组篇/leetcode1两数之和.md

@@ -100,7 +100,7 @@ public:
         for (int i = 0; i < nums.size(); ++i) {
             int t = target - nums[i];
             if (m.count(t)) return { m[t], i };
-            m[A[i]] = i;
+            m[nums[i]] = i;
         }
         return {};
     }