tom4649 · tom4649 · Mar 14, 2026 · nodchip · Mar 14, 2026 · oda
diff --git a/1/memo.md b/1/memo.md
@@ -0,0 +1,7 @@
+# 1. Two Sum
+
+- [1. Two Sum](https://leetcode.com/problems/two-sum/description/)
+- 愚直にsol1.pyを書いてしまった
+- ハッシュを使うのが模範解答
+    - https://discord.com/channels/1084280443945353267/1201211204547383386/1207251531041210408
+
diff --git a/1/sol1.py b/1/sol1.py
@@ -0,0 +1,11 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        for i in range(len(nums)):
+            for j in range(i + 1, len(nums)):
+                if nums[i] + nums[j] == target:
+                    return [i, j]
diff --git a/1/sol2.py b/1/sol2.py
@@ -0,0 +1,12 @@
+class Solution(object):
+    def twoSum(self, nums, target):
+        """
+        :type nums: List[int]
+        :type target: int
+        :rtype: List[int]
+        """
+        hashmap = {}
+        for i, num in enumerate(nums):
+            if num in hashmap:
+                return [i, hashmap[num]]
+            hashmap[target - num] = i