class Solution {
public int[] twoSum(int[] nums, int target) {
int n=nums.length;
Map<Integer,Integer> map=new HashMap<>();
for(int i=0;i<n;i++){
if(map.containsKey(target-nums[i])){
return new int[]{map.get(target-nums[i]),i};
}else{
map.put(nums[i],i);
}
}
return new int[0];
}
}
2.快乐数
class Solution {
public int getNext(int n){
int totalSum=0;
while (n>0){
int temp=n%10;
n=n/10;
totalSum+=temp*temp;
}
return totalSum;
}
public boolean isHappy(int n) {
Set<Integer> set=new HashSet<>();
while (n!=1 && !set.contains(n)){
set.add(n);
n=getNext(n);
}
return n==1;
}
}
class Solution {
public boolean containsNearbyDuplicate(int[] nums, int k) {
Map<Integer, Integer> map = new HashMap<Integer, Integer>();
int length = nums.length;
for (int i = 0; i < length; i++) {
int num = nums[i];
if (map.containsKey(num) && i - map.get(num) <= k) {
return true;
}
map.put(num, i);
}
return false;
}
}