본문 바로가기

Algorithm 🧑🏻‍💻/Leetcode31

[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 +.. 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 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.. 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.. 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 이란 한 문자열의 문자를 빠짐없이 사용하여 다른 문자열을 만들 수 있는 경우를.. 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; } }; 풀이 단순히 배.. 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¤t){ if(target==0){ ans.push_back(current); return; } for(int i=index; iindex && candidates[i]==candidate.. 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.. 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: .. 2021. 11. 15.

이전 1 2 3 4 다음

티스토리툴바