242.有效的字母异位词
答案
class Solution {
public boolean isAnagram(String s, String t) {
int[] arr = new int[26];
for (int i = 0; i < s.length(); i++){
arr[s.charAt(i) - 'a']++;
}
for (int i = 0; i < t.length(); i++){
arr[t.charAt(i) - 'a']--;
}
for (int i = 0; i < 26; i++){
if (arr[i] != 0){
return false;
}
}
return true;
}
}
349.两个数组的交集
答案
class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
Set<Integer> set = new HashSet<>();
Set<Integer> reset = new HashSet<>();
for (int i : nums1){
set.add(i);
}
for (int i : nums2){
if (set.contains(i)){
reset.add(i);
}
}
int[] arr = new int[reset.size()];
int j = 0;
for (int i : reset){
arr[j++] = i;
}
return arr;
}
}
202.快乐数
答案
class Solution {
public boolean isHappy(int n) {
Set<Integer> set = new HashSet<>();
while (n != 1 && !set.contains(n)){
set.add(n);
n = nextNumber(n);
}
if (n == 1){
return true;
} else {
return false;
}
}
private int nextNumber(int n){
int res = 0;
while (n > 0){
int temp = n % 10;
res += temp * temp;
n = n /10;
}
return res;
}
}
1.两数之和
答案
class Solution {
public int[] twoSum(int[] nums, int target) {
int[] res = new int[2];
if (nums == null || nums.length == 0){
return res;
}
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0; i < nums.length; i++){
int temp = target - nums[i];
if (map.containsKey(temp)){
res[0] = i;
res[1] = map.get(temp);
break;
}
map.put(nums[i], i);
}
return res;
}
}