Input array is sorted:
Use binary search or two pointers
Unsorted:
Use hash map, key = target - a[i], value = a[i]
Search and find containsKey
相关文章
- 1. Two Sum + 15. 3 Sum + 16. 3 Sum Closest + 18. 4Sum + 167. Two Sum II - Input array is sorted + 454. 4Sum II + 653. Two Sum IV - Input is a BST
- 29. leetcode 167. Two Sum II - Input array is sorted
- 【LeetCode】Two Sum II - Input array is sorted
- LeetCode 167. Two Sum II – Input array is sorted
- (双指针 二分) leetcode 167. Two Sum II - Input array is sorted
- Java [Leetcode 167]Two Sum II - Input array is sorted
- LeetCode 167 Two Sum II - Input array is sorted
- LeetCode & Q167-Two Sum II - Input array is sorted-Easy
- leetcode算法：Two Sum II - Input array is sorted
- 167. Two Sum II - Input array is sorted (在有序数组中确定和为给定值的两个元素的下标)