202 快乐数
看了随想录,才知道可以通过判断sum和是否相等来结束循环
class Solution {
Set<Integer> set = new HashSet<>();
public boolean isHappy(int n) {
String value = String.valueOf(n);
int sum = 0;
for (int i = 0; i < value.length(); i++) {
int temp = Integer.parseInt(String.valueOf(value.charAt(i)));
sum += temp * temp;
}
if (set.contains(sum)) {
return false;
} else {
set.add(sum);
}
if (sum == 1) {
return true;
}
return isHappy(sum);
}
}
1 两数之和
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] res = new int[2];
Map<Integer, Integer> numsMap = new HashMap<>();
for(int i = 0; i < nums.length; i++) {
if (numsMap.containsKey(target - nums[i])) {
res[0] = i;
res[1] = numsMap.get(target - nums[i]);
return res;
} else {
numsMap.put(nums[i], i);
}
}
return res;
}
}