[LeetCode]1.Two Sum
題解：
簡單雜湊表
程式碼
func twoSum(nums []int, target int) []int {
var result []int
m := make(map[int]int)
for i, v := range nums {
if prev_idx, ok := m[target-v]; ok {
result = append(result, prev_idx, i)
break
} else {
m[v] = i
}
}
return result
}
相關文章
- leetcode Sum系列LeetCode
- Leetcode Path SumLeetCode
- Leetcode 39 Combination SumLeetCode
- Leetcode 1 two sumLeetCode
- LeetCode | 1 Two SumLeetCode
- leetcode-39-Combination SumLeetCode
- Leetcode 40 Combination Sum IILeetCode
- Leetcode 15 3SumLeetCode
- Leetcode 18 4SumLeetCode
- LeetCode-1 Two SumLeetCode
- LeetCode 112. Path SumLeetCode
- python: leetcode - 1 Two SumPythonLeetCode
- LeetCode: Two sum(兩數之和)LeetCode
- [LeetCode] 523. Continuous Subarray SumLeetCode
- [LintCode/LeetCode] Check Sum of K PrimesLeetCode
- Leetcode 16 3Sum ClosestLeetCode
- LeetCode 259. Three Sum SmallerLeetCode
- LeetCode之Sum of Left Leaves（Kotlin）LeetCodeKotlin
- leetcode 371. Sum of Two IntegersLeetCode
- [LeetCode] 560. Subarray Sum Equals KLeetCode
- [LeetCode] 416. Partition Equal Subset SumLeetCode
- LeetCode #1:Two Sum（簡單題）LeetCode
- LeetCode Two Sum（001）解法總結LeetCode
- LeetCode: 560. Subarray Sum Equals KLeetCode
- LeetCode 209. Minimum Size Subarray Sum ?LeetCode
- Leetcode 209. Minimum Size Subarray SumLeetCode
- LeetCode 129. Sum Root to Leaf NumbersLeetCode
- leetcode-124-Binary Tree Maximum Path SumLeetCode
- python leetcode 之兩數之和(two sum)PythonLeetCode
- LeetCode 3Sum（015）解法總結LeetCode
- LeetCode 124. Binary Tree Maximum Path SumLeetCode
- LeetCode之Sum of Even Numbers After Queries（Kotlin）LeetCodeKotlin
- [LeetCode] 2841. Maximum Sum of Almost Unique SubarrayLeetCode
- LeetCode 3Sum Closest（016）解法總結LeetCode
- 【Leetcode】167. Two Sum II - Input array is sortedLeetCode
- 18. 4Sum(Leetcode每日一題-2020.10.05)LeetCode每日一題
- LeetCode 之 JavaScript 解答第一題 —— 兩數之和（Two Sum）LeetCodeJavaScript
- LeetCode C++ 1302. Deepest Leaves Sum【Tree/BFS/DFS】中等LeetCodeC++