목록개발 로그 (114)

Byte by Byte

1472. Design Browser History.cpp

class BrowserHistory { public: vectorv; int cur =0; BrowserHistory(string homepage) { v.push_back(homepage); } void visit(string url) { while(cur v.size()-1) cur = v.size()-1; else cur = cur+step..
개발 로그/알고리즘 2021. 10. 15. 12:04
861. Score After Flipping Matrix.cpp

첫 greedy 문제 class Solution { public: void flipRow(vector& grid,int m){ for(int j =0; j
개발 로그/알고리즘 2021. 10. 12. 22:07
1325. Delete Leaves With a Given Value.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* removeLeafNodes(TreeNode* root, int targ..
개발 로그/알고리즘 2021. 10. 12. 18:24
701. Insert into a Binary Search Tree.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* insertIntoBST(TreeNode* root, int val) {..
개발 로그/알고리즘 2021. 10. 8. 22:06
1641. Count Sorted Vowel Strings.cpp

재밌는 문제. class Solution { public: int countVowelStrings(int n) { int a=1,b=1,c=1,d=1,e=1; for(int i =2; i
개발 로그/알고리즘 2021. 10. 8. 17:37
1829. Maximum XOR for Each Query.cpp

class Solution { public: vector getMaximumXor(vector& nums, int maximumBit) { vectorres; int len = nums.size(); int x = pow(2,maximumBit)-1; int tmp=0; for(int i =0; i< len; i++){ tmp = tmp^nums[i]; res.push_back(tmp ^ x); } reverse(res.begin(),res.end()); return res; } };
개발 로그/알고리즘 2021. 10. 8. 17:19
1748. Sum of Unique Elements.cpp

class Solution { public: int sumOfUnique(vector& nums) { sets; int res=0; int tmp = nums[0]; int cnt=0; sort(nums.begin(),nums.end()); for(int i = 0; i1) s.emplace(nums[i]); } for(int i = 0; i< nums.size(); i++){ res+= nums[i]; for(auto it : s){ if(nums[i]==it){ res-= nums[i]; break; } } } return res; ..
개발 로그/알고리즘 2021. 10. 8. 16:01
961. N-Repeated Element in Size 2N Array.cpp

class Solution { public: int repeatedNTimes(vector& nums) { int n = nums.size()/2; sort(nums.begin(),nums.end()); int tmp = nums[0]; int cnt = 0; for(int i=0; i
개발 로그/알고리즘 2021. 10. 8. 15:46
이전 Prev 1 ··· 4 5 6 7 8 9 10 ··· 15 Next 다음