Byte by Byte

from collections import Counter str에 대해서, 각 char를 key로, 발생 빈도 수를 value를 하는 dict를 만들어줌. str = "hello" Counter(str) 하면 , { 'h' : 1 , 'e' : 1 , 'l' : 2, 'o' : 1 } 이렇게 나옴. dict for loop 는 for key, value in {dict}.items(): class Solution: def canConstruct(self, ransomNote: str, magazine: str) -> bool: from collections import Counter rans = Counter(ransomNote) magz = Counter(magazine) for key,value in..

class Solution { public: vector findDuplicates(vector& nums) { vectorres; mapm; for(int i =0; i

class Solution { public: int maximumPopulation(vector& logs) { int alive[101]={0,}; for(auto log : logs){ for(int i = log[0]-1950; i

🔑 map의 두번째 인자에 vector container도 삽입 가능! class Solution { public: vector groupAnagrams(vector& strs) { vectorres; mapm; for(auto &s : strs) { string tmp = s; sort(tmp.begin(),tmp.end()); m[tmp].push_back(s); } for(auto sub : m) { //cout

class Solution { public: vector findOcurrences(string text, string first, string second) { vectors; vectorres; for(int i =0; i

class Solution { public: int minOperations(vector& logs) { int res =0; for(auto l : logs){ if (l.find("..") != std::string::npos) { if(res!=0) res--; } else if(l.find(".") == std::string::npos){ res++; } } return res; } };

class Solution { public: string reformatNumber(string number) { if(number.size()

class Solution { public: int distributeCandies(vector& candyType) { sets; for(auto i : candyType) s.insert(i); return min(candyType.size()/2,s.size()); } };