티스토리

JuHyeong.dev

검색하기

블로그 홈

JuHyeong.dev

dkswnkk.tistory.com/m

어제보다 나은, 오늘보다 성장한 내일

구독자: 123

방명록 방문하기

주요 글 목록

[Leetcode,c++] Add Digits 문제 https://leetcode.com/problems/add-digits/ Add Digits - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 (1) 재귀, 반복문을 사용한 풀이 class Solution { public: int addDigits(int num) { int temp1=0, temp2=0, ans=num; while(true){ while(num>9){ temp1 = num%10; temp2 = num/10; ans = temp1 +.. 공감수 0 댓글수 0 2022. 3. 2.
[Leetcode,c++] Happy Number 문제 Happy Number - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: bool isHappy(int n) { string s; s = to_string(n); while(true){ unsigned long long temp = 0; for(int i=0; i 공감수 0 댓글수 0 2022. 3. 2.
[Leetcode,c++] Majority Element 문제 Majority Element - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int majorityElement(vector& nums) { mapm; for(int i:nums) m[i]++; int cnt=-1,ans; for(auto it=m.begin(); it!=m.end(); it++){ if(it->second>cnt){ cnt=it->second; ans=it->first; }; } ret.. 공감수 0 댓글수 0 2021. 11. 28.
[Leetcode,c++] Network Delay Time 문제 Network Delay Time - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: vectorgraph[101]; int d[101]; void dijkstra(int start){ priority_queuepq; pq.push({0,start}); d[start]=0; while(!pq.empty()){ int dist = -pq.top().first; int now = pq.top().second; p.. 공감수 0 댓글수 0 2021. 11. 22.
[Leetcode,c++] Valid Anagram 문제 Valid Anagram - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: bool isAnagram(string s, string t) { sort(s.begin(),s.end()); sort(t.begin(),t.end()); if(t==s) return true; else return false; } }; 풀이 Anagram 이란 한 문자열의 문자를 빠짐없이 사용하여 다른 문자열을 만들 수 있는 경우를.. 공감수 0 댓글수 0 2021. 11. 20.
[Leetcode,c++] Single Number 문제 Single Number - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int singleNumber(vector& nums) { mapm; int ans; for(int i:nums) m[i]++; for(auto it = m.begin(); it!=m.end(); it++){ if(it->second==1){ ans=it->first; break; } } return ans; } }; 풀이 단순히 배.. 공감수 0 댓글수 0 2021. 11. 19.
[Leetcode,c++] Combination Sum II 문제 Combination Sum II - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: void dfs(int index, vector& candidates, int target, vector& ans, vector&current){ if(target==0){ ans.push_back(current); return; } for(int i=index; iindex && candidates[i]==candidate.. 공감수 0 댓글수 0 2021. 11. 16.
[Leetcode,c++] Subsets II 문제 Subsets II - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: mapvisited; vectorans; void dfs(int num, vector&nums,vectorcurrent){ sort(current.begin(),current.end()); if(!visited[current]){ ans.push_back(current); visited[current]=1; } if(num>nums.siz.. 공감수 0 댓글수 0 2021. 11. 15.
[Leetcode,c++] Rotate Image 문제 Rotate Image - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 새로운 공간 선언 class Solution { public: void rotate(vector& matrix) { int n = matrix.size(); vectorans(n); for(int i=0; i=0; k--){ ans[i].push_back(matrix[k][i]); } } matrix = ans; } }; 제자리 회전 class Solution { public: .. 공감수 1 댓글수 0 2021. 11. 15.
[Leetcode,c++] Permutations II 문제 Permutations II - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: vector permuteUnique(vector& nums) { vectorans; sort(nums.begin(),nums.end()); do{ ans.push_back(nums); }while(next_permutation(nums.begin(),nums.end())); return ans; } }; 공감수 0 댓글수 0 2021. 11. 15.
[Leetcode,c++] Roman to Integer 문제 Roman to Integer - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int sum=0; int roman_to_int(char c1,char c2){ bool flag = true; if(c1=='I'){ if(c2=='V'){ sum+=4; flag = false; } else if(c2 =='X'){ sum+=9; flag = false; } else sum+=1; } else if(c1==.. 공감수 0 댓글수 0 2021. 11. 15.
[Leetcode,c++] Find First and Last Position of Element in Sorted Array 문제 Find First and Last Position of Element in Sorted Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: vector searchRange(vector& nums, int target) { int start = 0; int end = nums.size()-1; int first_index = -1,last_index = -1; vectorans; while(sta.. 공감수 0 댓글수 0 2021. 11. 14.
[Leetcode,c++] Group Anagrams 문제 Group Anagrams - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: vector groupAnagrams(vector& strs) { mapm; mapchar_check; sort(strs.begin(),strs.end()); vectortemp = strs; for(int i=0; i 공감수 0 댓글수 0 2021. 11. 14.
[Leetcode,c++] Next Permutation 문제 Next Permutation - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: void nextPermutation(vector& nums) { next_permutation(nums.begin(),nums.end()); } }; 공감수 0 댓글수 0 2021. 11. 14.
[Leetcode,c++] Length of Last Word 문제 Length of Last Word - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int lengthOfLastWord(string s) { vectorparsing; string temp; for(int i=0; i 공감수 0 댓글수 0 2021. 11. 14.
[Leetcode,c++] Container With Most Water 문제 Container With Most Water - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int maxArea(vector& height) { int start = 0; int end = height.size()-1; int ans = -1; while(start 공감수 0 댓글수 0 2021. 11. 14.
[Leetcode,c++] Remove Duplicates from Sorted Array 문제 Remove Duplicates from Sorted Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int removeDuplicates(vector& nums) { nums.erase(unique(nums.begin(),nums.end()),nums.end()); return nums.size(); } }; 공감수 0 댓글수 0 2021. 11. 14.
[Leetcode,c++] Longest Common Prefix 문제 Longest Common Prefix - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: string longestCommonPrefix(vector& strs) { string ans=""; for(int i=0; i 공감수 0 댓글수 0 2021. 11. 11.
[Leetcode,c++] Permutations 문제 Permutations - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: vector permute(vector& nums) { vectorans; sort(nums.begin(),nums.end()); do{ ans.push_back(nums); }while(next_permutation(nums.begin(),nums.end())); return ans; } }; 풀이 단순하게 순열을 구하는 문제입니다... 공감수 0 댓글수 0 2021. 11. 10.
[Leetcode,c++] Best Time to Buy and Sell Stock 문제 Best Time to Buy and Sell Stock - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int maxProfit(vector& prices) { int min_index,min_value=1e9,ans; for(int i=0; i 공감수 0 댓글수 0 2021. 11. 10.
[Leetcode,c++] Climbing Stairs 문제 Climbing Stairs - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int climbStairs(int n) { int dp[46]; dp[1]=1; dp[2]=2; for(int i=3; i 공감수 0 댓글수 0 2021. 11. 9.
[Leetcode,c++] Maximum Subarray 문제 Maximum Subarray - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int maxSubArray(vector& nums) { int dp[100001]={0, }; int ans=-1e9; if(nums.size()==1) return nums.back(); for(int i=0; i 공감수 0 댓글수 0 2021. 11. 9.
[Leetcode,c++] Valid Parentheses 문제 Valid Parentheses - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: bool isValid(string s) { stackst; for(int i=0; i 공감수 0 댓글수 0 2021. 11. 9.
[Leetcode,c++] Palindrome Number 문제 Palindrome Number - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: bool isPalindrome(int x) { if(x 공감수 0 댓글수 0 2021. 11. 9.
[Leetcode,c++] Search Insert Position 문제 Search Insert Position - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: int searchInsert(vector& nums, int target) { int start = 0; int end = nums.size(); int ans = 0; sort(nums.begin(),nums.end()); while(start=nums.size()) break; if(target == nums[m.. 공감수 0 댓글수 0 2021. 11. 9.
[Leetcode,c++] Find the City With the Smallest Number of Neighbors at a Threshold Distance 문제 Find the City With the Smallest Number of Neighbors at a Threshold Distance - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { int graph[101][101]={0,}; public: int findTheCity(int n, vector& edges, int distanceThreshold) { for (int i = 0; i < 101; i++) { fill.. 공감수 0 댓글수 0 2021. 11. 7.
[Leetcode,c++] Combination Sum 문제 Combination Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { mapduplicate; public: vectorans; void dfs(vector &candidates,int &target,int sum,vector route){ if(sum==target){ sort(route.begin(),route.end()); if(duplicate[route]==0){ duplicate[route]++; an.. 공감수 0 댓글수 0 2021. 11. 7.
[Leetcode,c++] Multiply-Strings 문제 Multiply Strings - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 코드 class Solution { public: string multiply(string num1, string num2) { if(num1 == "0" || num2 == "0") return "0"; vector v(num1.length() + num2.length(), 0); for(int i = num1.length()-1; i >= 0; i--){ for(int k .. 공감수 0 댓글수 0 2021. 11. 7.
[Leetcode,c++] Longest Common Subsequence Longest Common Subsequence - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public: int longestCommonSubsequence(string text1, string text2) { int dp[1001][1001]; for(int i=1; i 공감수 0 댓글수 0 2021. 10. 23.
[Leetcode,c++] Robot Bounded In Circle Robot Bounded In Circle - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public: bool isRobotBounded(string instructions) { int visited[101][101]; int x=0,y=0,dir=0; //e(0),w(1),s(2),n(3) int cnt=4; while(cnt--){ for(int i=0; i3) dir=0; } if(cmd=='R'){ dir-=1; if(.. 공감수 0 댓글수 0 2021. 10. 23.

문의안내

티스토리
로그인
고객센터

티스토리는 카카오에서 사랑을 담아 만듭니다.