목록PS (55)

ice rabbit programming

[LeetCode] Combine Two Tables

https://leetcode.com/problems/combine-two-tables/ Combine Two Tables - 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 # Write your MySQL query statement below SELECT Person.FirstName, Person.LastName, Address.City, Address.State From Person LEFT JOIN Address ON Person.PersonId=Add..
PS/LeetCode 2020. 4. 27. 21:02
[LeetCode] Customers Who Never Order

https://leetcode.com/problems/customers-who-never-order/ Customers Who Never Order - 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 SQL을 사용하는 문제를 간만에 풀었다. 어려운 문제는 아니고 JOIN과 NOT IN으로 차집합을 구하는 문제였다. # Write your MySQL query statement below SELECT Customers.Name AS Customers From Cus..
PS/LeetCode 2020. 4. 26. 21:48
[LeetCode] Add Binary

https://leetcode.com/problems/add-binary/ Add Binary - 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 이 문제도 제목 그대로 이진수로 주어지는 string을 더해서 string으로 반환하는 문제이다. 논리회로 단계에서 Adder를 만들듯이 구현하였다. public class Solution { public string AddBinary(string a, string b) { int shortLength = (a.Leng..
PS/LeetCode 2020. 4. 23. 21:50
[LeetCode] Same Tree

https://leetcode.com/problems/same-tree/ Same Tree - 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 제목 그대로 주어진 Tree가 동일한 Tree인지 판단하는 문제이다. DFS를 통해 순회하면서 노드의 값들을 비교하는 식으로 구현하였다. 간만에 메모리와 시간 모두에서 100%를 기록하였다. /** * Definition for a binary tree node. * struct TreeNode { * int val; * ..
PS/LeetCode 2020. 4. 22. 23:18
[LeetCode] Majority Element

https://leetcode.com/problems/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 가장 많이 등장하는 원소를 찾아내는 문제이다. 별 생각 없이 map을 이용해 풀었다. class Solution { public: int majorityElement(vector& nums) { int size = nums.size(); map counts; for(int i=0;isecond)++..
PS/LeetCode 2020. 4. 21. 23:40
[LeetCode] Pascal's Triangle

https://leetcode.com/problems/pascals-triangle/ Pascal's Triangle - 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 generate(int numRows) { vector pascal; if(numRows
PS/LeetCode 2020. 4. 20. 23:58
[LeetCode] Maximum Depth of Binary Tree (feat. 고정관념?)

https://leetcode.com/problems/maximum-depth-of-binary-tree/ Maximum Depth of Binary Tree - 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 바로 전 문제와 반대로 가장 깊은 leaf node의 depth를 구하는 문제이다. 간단한 DFS 문제이고, 재귀를 이용해 풀었다. /** * Definition for a binary tree node. * struct TreeNode { * int va..
PS/LeetCode 2020. 4. 20. 23:14
[LeetCode] Minimum Depth of Binary Tree

https://leetcode.com/problems/minimum-depth-of-binary-tree/ Minimum Depth of Binary Tree - 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 이진 트리에서 최소 깊이를 가진 leaf node의 depth를 구하는 문제이다. 기본적인 BFS 문제라고 생각한다. /** * Definition for a binary tree node. * struct TreeNode { * int val; * Tre..
PS/LeetCode 2020. 4. 20. 23:08
이전 Prev 1 2 3 4 5 6 7 Next 다음