242.有效的字母异位词
class Solution {
public:
bool isAnagram(string s, string t) {
int hash[26] = {0};
for (auto c : s) {
hash[c - 'a'] ++;
}
for (auto c : t) {
hash[c - 'a'] --;
}
for (auto c : hash) {
if (c != 0) return false;
}
return true;
}
};
349. 两个数组的交集
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
unordered_set<int> result;
unordered_set<int> numset(nums1.begin(), nums1.end());
for (int c : nums2) {
if (numset.find(c) != numset.end()) result.insert(c);
}
return vector<int>(result.begin(), result.end());
}
};
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
unordered_set<int> result;
int hash[1001] = {0};
for (int i : nums1) {
hash[i] = 1;
}
for (int i : nums2) {
if (hash[i] == 1) result.insert(i);
}
return vector<int>(result.begin(), result.end());
}
};
202. 快乐数
class Solution {
public:
int getsum(int n) {
int sum = 0;
while (n) {
sum += (n % 10) * (n % 10);
n /= 10;
}
return sum;
}
bool isHappy(int n) {
unordered_set<int> result;
while (1) {
int sum = getsum(n);
if (sum == 1) return true;
if (result.find(sum) != result.end()) {
return false;
} else {
result.insert(sum);
}
n = sum;
}
}
};
1. 两数之和
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 s = target - nums[i];
auto iter = map.find(s);
if (iter != map.end()) {
return {iter->second, i};
} else {
map.insert(pair<int, int> (nums[i], i));
}
}
return {};
}
};