Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
One-Pass Hash Table
1 |
public int[] twoSum(int[] nums, int target) { |
时间复杂度:O(n)
空间复杂度:O(n)
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
1 |
public int[] twoSum(int[] nums, int target) { |
时间复杂度:O(n)
空间复杂度:O(n)
近期评论