今天的题目简单,复习回溯去了
class Solution {
public:
bool isAnagram(string s, string t) {
int arr[26];
for (int i = 0; i < t.size(); i++) {
arr[t[i] - 'a']++;
}
for (int i = 0; i < s.size(); i++) {
arr[s[i] - 'a']--;
}
for (int j = 0; j < 26; j++) {
if (arr[j] != 0) {
return false;
}
}
return true;
}
};
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
unordered_set<int> result;
int hash[1100];
for(int num : nums1)
{
hash[num] = 1;
}
for(int num : nums2)
{
if(hash[num]==1)
{
result.insert(num);
}
}
return vector<int>(result.begin(), result.end());
}
};
class Solution {
public:
int getHappy(int n) {
int sum = 0;
while (n) {
sum += (n % 10)*(n%10);
n /= 10;
}
return sum;
}
bool isHappy(int n) {
unordered_set<int> set;
set.insert(n);
while (n != 1) {
n = getHappy(n);
if (set.find(n) != set.end())
return false;
set.insert(n);
}
return true;
}
};
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int, int> map;
for (int i = 0; i < nums.size(); i++) {
int findNum = target - nums[i];
if (map.find(findNum) != map.end())
return {i, map[findNum]};
map[nums[i]] = i;
}
return {};
}
};
最后一题一定要有返回值,虽然题目的测试例子能保证肯定在循环里返回了,但是编译器不知道啊,C++里函数一定要和返回值对上!!!