자라는 개발자

class Solution { public: static bool cmp(pair& a, pair& b) { return a.second < b.second; } int majorityElement(vector& nums) { int res; unordered_map map; for(int i=0;i

문제풀이 class Solution { public: bool canConstruct(string ransomNote, string magazine) { unordered_map um1,um2; for(int i=0;i

풀이 class Solution { public: int firstUniqChar(string s) { unordered_map um; for(int i=0;i

풀이 1 // 15:01 ~ class Solution { public: vector intersect(vector& nums1, vector& nums2) { vector res; map m1,m2; for(auto iter: nums1) m1[iter]++; for(auto iter: nums2) m2[iter]++; for (auto it = m1.begin(); it != m1.end(); it++) { if(m2[it->first]) { int tmp = min((it->second),(m2[it->first])); for(int i=0;ifirst); } } return res; } };풀이 2 // 15:01 ~ class Solution { public: vector intersect(ve..

```c //17:15~ class Solution { public: bool isAnagram(string s, string t) { bool res = true; if(s.size() != t.size()) return false; int arr[27]={},brr[27]={}; for(int i=0;i