### 242
```C++
class Solution {
public:
bool isAnagram(string s, string t) {
int hash_map[26]={0};
for(int i=0;i<s.length();i++){
hash_map[s[i]-'a']++;
}
for(int j=0;j<t.length();j++){
hash_map[t[j]-'a']--;
}
for(int i=0;i<26;i++){
if(hash_map[i]!=0){
return false;
}
}
return true;
}
};
```
### 349
```C++
//C++ STL容器的基本操作要看一下
class Solution {
public:
vector<int> intersection(vector<int>& nums1, vector<int>& nums2) {
unordered_set<int> res;
unordered_set<int> nums_set(nums1.begin(),nums1.end());
for(int num:nums2){
if(nums_set.find(num)!=nums_set.end()){
res.insert(num);
}
}
return vector<int>(res.begin(),res.end());
}
};
```
### 202
```C++
class Solution {
public:
int getsum(int n){
int sum=0;
while(n){
sum+=(n%10)*(n%10);
n=n/10;
}
return sum;
}
bool isHappy(int n) {
unordered_set<int> res;
while(1){
int sum=getsum(n);
if(sum==1){
return true;
}else if(res.find(sum)!=res.end()){
return false;
}else{
res.insert(sum);
}
n=sum;
}
}
};
```
### 1
```C++
//暴力
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
//unordered_set<pair<int,int>> res;
//int len=sizeof(nums)/sizeof(nums[0]);
vector<int> res;
for(int i=0;i<nums.size()-1;i++){
for(int j=i+1;j<nums.size();j++){
int sum=nums[i]+nums[j];
if(sum==target){
res.push_back(i);
res.push_back(j);
break;
}
}
}
return res;
}
};
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
unordered_map<int,int> map;
for(int i=0;i<nums.size();i++){
if(map.find(target-nums[i])!=map.end()){
return {map.find(target-nums[i])->second,i};
}
map.insert(pair(nums[i],i));
}
return {};
}
};
```
代码随想录第5天
最新推荐文章于 2024-08-12 19:18:27 发布