목록전체 글 (137)

Krononberg

1630. Arithmetic Subarrays.cpp

class Solution { public: vector checkArithmeticSubarrays(vector& nums, vector& l, vector& r) { int len = l.size(); vectortmp; vectorres; for(int i =0; i
개발 로그/알고리즘 2021. 10. 6. 11:12
1309. Decrypt String from Alphabet to Integer Mapping.cpp

class Solution { public: string freqAlphabets(string s) { //1~9 //10#~26# string res=""; string tmp =""; for(int i =0; i
개발 로그/알고리즘 2021. 10. 5. 11:36
1827. Minimum Operations to Make the Array Increasing.cpp

요구조건 정확히 안봐서 헤맴.. class Solution { public: int minOperations(vector& nums) { int res =0; int len = nums.size(); for(int i =0; i=nums[i+1]){ res += (nums[i] - nums[i+1] +1); nums[i+1] += (nums[i] - nums[i+1] +1); }a } return res; } };
개발 로그/알고리즘 2021. 10. 5. 10:57
1863. Sum of All Subset XOR Totals.cpp

난이도가 높아지니까, dp알고리즘 활용 문제가 자꾸 나온다 😕 //thanks to https://www.youtube.com/watch?v=CJ9EicV9nWc&ab_channel=CODE_CROSING class Solution { public: int subsetXORSum(vector& nums) { return helper(nums, 0,0); } int helper(vector&nums,int level, int currentXOR){ if(level == nums.size()) return currentXOR; int inc = helper(nums,level +1,currentXOR^nums[level]); int exc = helper(nums,level +1,currentXOR); re..
개발 로그/알고리즘 2021. 10. 4. 16:44
1382. Balance 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: vectorinorder; void saveNode(TreeNode* root){ if(!..
개발 로그/알고리즘 2021. 10. 4. 14:51
763. Partition Labels.cpp

class Solution { public: vector partitionLabels(string s) { vectorres; vectorlast(26,0); for(int i =0; i
개발 로그/알고리즘 2021. 10. 3. 16:16
1605. Find Valid Matrix Given Row and Column Sums.cpp

class Solution { public: vector restoreMatrix(vector& rowSum, vector& colSum) { int m = rowSum.size(); int n = colSum.size(); vectorres(m,vector(n)); for(int i =0; i< m; i++){ for(int j =0; j
개발 로그/알고리즘 2021. 10. 3. 15:30
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
이전 Prev 1 ··· 10 11 12 13 14 15 16 ··· 18 Next 다음