목록leetcode (16)

Byte by Byte

1252. Cells with Odd Values in a Matrix.cpp

class Solution { public: int oddCells(int m, int n, vector& indices) { vectorx(n,0); vectormat(m,x); for(int x=0; x
개발 로그/알고리즘 2021. 10. 2. 21:54
1725. Number Of Rectangles That Can Form The Largest Square.cpp

class Solution { public: int countGoodRectangles(vector& rectangles) { int smallest=0; vectorv; for(int i =0; i smallest) smallest = tmp; v.push_back(tmp); } int cnt=0; for(int i =0; i
개발 로그/알고리즘 2021. 10. 2. 21:35
894. All Possible Full Binary Trees.cpp

어려워서 남이 풀어놓은 것을 보고 외워서 작성함. 아직은 혼자 짜라고하면 못짤듯하나, recursive를 따라가본 정도로 만족. //spend 7hours to understand. (still not fully understood..) //this is not my own-created code. //thanks to https://leetcode.com/problems/all-possible-full-binary-trees/discuss/1221826/C%2B%2B-Easy-Recursive-No-Extra-Function-Needed-(With-Explanation) /** * Definition for a binary tree node. * struct TreeNode { * int val; * ..
개발 로그/알고리즘 2021. 10. 2. 20:37
1008. Construct Binary Search Tree from Preorder Traversal.cpp

/** * 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: TreeNode* newNode(int x){ TreeNode* tmp = new Tree..
개발 로그/알고리즘 2021. 10. 2. 16:25
1817. Finding the Users Active Minutes.cpp

class Solution { public: vector findingUsersActiveMinutes(vector& logs, int k) { vectorres(k); sort(logs.begin(),logs.end()); sets; int stand = logs[0][0]; for (int i = 0; i < logs.size(); i++) { if (logs[i][0] != stand) { ++res[s.size() - 1]; stand = logs[i][0]; s.clear(); s.insert(logs[i][1]); } else s.insert(logs[i][1]); if(i ==logs.size()-1) ++res[s.size() - 1]; } return res; } };
개발 로그/알고리즘 2021. 9. 30. 15:15
797. All Paths From Source to Target.cpp

Graph -> dfs (depth first search) class Solution { public: int target; vector res; vector tmp; void dfs(vector& graph, int currNode = 0) { tmp.push_back(currNode); if (currNode == target) res.push_back(tmp); else { for (int node: graph[currNode]) { dfs(graph, node); } } } vector allPathsSourceTarget(vector& graph) { target = graph.size() - 1; dfs(graph); return res; } };
개발 로그/알고리즘 2021. 9. 30. 12:21
804. Unique Morse Code Words.cpp

class Solution { public: int uniqueMorseRepresentations(vector& words) { vectorcode ={".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."}; sets; for(int i =0; i
개발 로그/알고리즘 2021. 9. 29. 11:39
1551. Minimum Operations to Make Array Equal.cpp

이런 문제는 대충 디버그하면서 풀게 되면, 시간 오래 걸림. class Solution { public: int minOperations(int n) { int res =0; if(n==1||n==0){ return 0; } else{ if(n%2==0){ for(int i =0; i
개발 로그/알고리즘 2021. 9. 27. 11:59
이전 Prev 1 2 Next 다음