题目链接:242. 有效的字母异位词 - 力扣(LeetCode)
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 j = 0; j < t.length(); j++){
arr[t.charAt(j) - 'a']--;
}
for(int k = 0; k < 26; k++){
if(arr[k] != 0){
return false;
}
}
return true;
}
}
题目链接:349. 两个数组的交集 - 力扣(LeetCode)
class Solution {
public int[] intersection(int[] nums1, int[] nums2) {
if(nums1 == null || nums1.length == 0 || nums2 == null || nums2.length == 0){
return new int[0];
}
Set<Integer> set1 = new HashSet<>();
Set<Integer> set2 = new HashSet<>();
for(int i : nums1){
set1.add(i);
}
for(int j : nums2){
if(set1.contains(j)){
set2.add(j);
}
}
int[] arr = new int[set2.size()];
int z = 0;
for(int k : set2){
arr[z++] = k;
}
return arr;
}
}
需要掌握Java集合的相关知识
class Solution {
public boolean isHappy(int n) {
Set<Integer> set = new HashSet<>();
while(n != 1 && !set.contains(n)){
set.add(n);
n = getNextNumber(n);
}
return n == 1;
}
private int getNextNumber(int n){
int res = 0;
while(n > 0){
int tem = n % 10;
res += tem * tem;
n = n / 10;
}
return res;
}
}
注意但凡出现过循环就不是快乐数,注意怎么取一个数字的每一位
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[1] = i;
res[0] = map.get(temp);
break;
}
map.put(nums[i], i);
}
return res;
}
}
注意是遍历当前元素找前面的元素是否能组成target