Krononberg

class OrderedStream { public: vectoros; int x; int idx =0; OrderedStream(int n) { vector temp(n); os = temp; x = n; } vector insert(int idKey, string value) { vectorres; os[idKey-1] = value; for(; idxinsert(idKey,value); */

class Solution { public: int maxWidthOfVerticalArea(vector& points) { vectorv; for(int i=0; i

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} * }; */ class Solution { public: int sum =0; int rangeSumBST(TreeNode* root, int lo..

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} * }; */ class Solution { public: int sumEvenGrandparent(TreeNode* root) { if(root==..

🔑 3가지 주안점. //map에 데이터 넣을때 m.insert(pair(groupSizes[i],i)); //key find했을 때, 아무것도 없으면, m.end()를 return한다. if(m.find(i)!=m.end()){ //m.equal_range(i).first ~ m.equal_range(i).second : first에는 begin값, second에는 end값이 있다. for (auto it= m.equal_range(i).first; it!=m.equal_range(i).second; ++it){ //it의 data를 return. v.push_back(it->second); 👉 전체 코드 내용 class Solution { public: vector groupThePeople(vecto..

discussion에서 가져온 배울만한 깔끔한 코드. int maxIncreaseKeepingSkyline(vector& grid) { int n = grid.size(); vector col(n, 0), row(n, 0); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { row[i] = max(row[i], grid[i][j]); col[j] = max(col[j], grid[i][j]); } } int res = 0; for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) res += min(row[i], col[j]) - grid[i][j]; return res; }

class Solution { public: vector minOperations(string boxes) { int n = boxes.size(); vector res(n); unordered_set st; for (int i = 0; i < n; ++i) { if (boxes[i] == '1') st.insert(i); } for (int i = 0; i < n; ++i) { for (auto idx : st) { res[i] += abs(idx - i); } } return res; } };

class Solution { public: string truncateSentence(string s, int k) { string ans = ""; for(int i =0; i