use hashmap strore the data
the time complexity is about o(n) cost in the traversal of the int array;and the map cost o(1) if not collistion,however if the collision exist ,time cost is o(n)
the space complexity is o(n) store the value
public int [] twoSum(int [] sums,int target){
Map<Integer,Integer> map =new HashMap();
for(int i=0;i<sum.length;i++){
int complement =tatget - sums[i];
if(map.containKey(complement)){
return new Int[]{i,map.get(complement)}
}
map.put(sum[i],i]);
}
Two Sum It is not easy to write Two-Sum right for the fir...
Two sum From https://leetcode.com/problems/two-sum/descri...
Two Sum I https://leetcode.com/problems/two-sum/#/descrip...
1. Two Sum 题目:https://leetcode.com/problems/two-sum/ 难度: ...
1. Two Sum[https://leetcode-cn.com/problems/two-sum/] 字典（...
LeetCode 1. Two Sum (Easy) LeetCode 1. Two Sum (Easy) 原题链...
这道题相当于two sum 以及 two sum II 的follow up题。是two pointer类题目。而...
D84 371. Sum of Two Integers 题目链接 371. Sum of Two Integer...
two sum 3 sum 3Sum Closest 4 sum 利用set来实现： 3 sum 4 sum
D89 653. Two Sum IV - Input is a BST 题目链接 653. Two Sum IV...
本文标题：Two Sum
本文链接：https://www.haomeiwen.com/subject/bwfznqtx.html
网友评论