Krononberg

class Solution { public: vector findSmallestSetOfVertices(int n, vector& edges) { vectorres; sets; for(int i =0; i

class Solution { public: bool areOccurrencesEqual(string s) { int check[26]={0,}; for(int i =0; i

스택 구현 문제. 숙달이 중요한 것 같다. class CustomStack { public: int maxn; int top; int *st; CustomStack(int maxSize) { maxn = maxSize; st = new int[maxn]; top = -1; } void push(int x) { if(top != maxn-1){ st[++top] = x; } } int pop() { if(top==-1) return -1; return st[top--]; } void increment(int k, int val) { int inc = min(k-1,top); for(int i =0; ipush(x); * int param_2 = obj->pop(); * obj->increment(k,val..

class Solution { public: bool squareIsWhite(string coordinates) { string& s = coordinates; if((s[0]%2==0 &&s[1]%2==0) || s[0]%2==1&&s[1]%2==1) return false; return true; } }; //better solution class Solution { public: bool squareIsWhite(string coordinates) { return coordinates[0]%2 != coordinates[1]%2; } };

첫 hard 문제.. //thanks to https://www.youtube.com/watch?v=P8K26R2Ci3c&ab_channel=ShivamPatel class Solution { public: int m; int n; int startx; int starty; int endx; int endy; int pathall; int res =0; void dfs(vector grid,int i, int j, int path){ if(i =m || j =n || grid[i][j]==-1) return; if(i==endx && j ==endy && path == pathall){ res++; return; } grid[i][j]=-1; path++; dfs(grid,i+1,j,path); dfs(..

find 활용 하면 빠름. class Solution { public: int numOfStrings(vector& patterns, string word) { int res =0; for(int i =0; iword.size()) continue; for(int j =0; j< word.size()-(patterns[i].size())+1; j++){ if(patterns[i]==word.substr(j,patterns[i].size())){ res++; break; } } } return res; } }; //better solution class Solution { public: int numOfStrings(vect..

class Solution { public: void duplicateZeros(vector& arr) { for(int i =0; i< arr.size(); i++){ if(arr[i]==0 && i =i+2; j--){ arr[j] = arr[j-1]; } arr[i+1]=0; i++; } else if (arr[i]==0 && i ==arr.size()-2) { arr[i+1]=0; i++; } } } };

class Solution { public: string sortString(string s) { string res=""; sort(s.begin(),s.end()); int savechar[26] ={0,}; for(int i =0; i