목록알고리즘 (194)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 1304. Find N Unique Integers Sum up to Zero

1304. Find N Unique Integers Sum up to Zero https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/ Find N Unique Integers Sum up to Zero - 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) Straight forward n 숫자가 주어지면 유니크한 숫자 n개를 더했을 때 0를 만드는 array를 구하는 문제입니다. ..
알고리즘/LeetCode 2021. 12. 13. 16:25
LeetCode 풀기 - 1382. Balance a Binary Search Tree

1382. Balance a Binary Search Tree https://leetcode.com/problems/balance-a-binary-search-tree/ Balance a Binary Search 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 문제) 솔루션1) - Bianry Search Tree 풀이 전략: 넘겨 받은 root 트리를 inorder 순회하여 정렬된 val를 리스트를(nums) 구성 Binary Search Tree ..
알고리즘/LeetCode 2021. 12. 9. 07:29
LeetCode 풀기 - 1551. Minimum Operations to Make Array Equal

1551. Minimum Operations to Make Array Equal https://leetcode.com/problems/minimum-operations-to-make-array-equal/ Minimum Operations to Make Array Equal - 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) - Straight Forward mid를 구하고 arr의 길이가 짝수인 경우와 홀수인 경우를 나눠서 생각하며 쉽게 풀립니..
알고리즘/LeetCode 2021. 12. 9. 06:55
LeetCode 풀기 - 1572. Matrix Diagonal Sum

1572. Matrix Diagonal Sum https://leetcode.com/problems/matrix-diagonal-sum/ Matrix Diagonal 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 문제) 솔루션1) - Straight forward 왼쪽 상단에서 부터 오른쪽 하단으로 탐색하면서 더합니다. 오른쪽 상단에서 부터 왼쪽 하단으로 탐색하면서 더합니다. 만약 매트릭스가 row가 홀수 크기로 되어 있다면 중간에 원소를 두 번 더했..
알고리즘/LeetCode 2021. 12. 6. 08:19
LeetCode 풀기 - 1290. Convert Binary Number in a Linked List to Integer

1290. Convert Binary Number in a Linked List to Integer https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/ Convert Binary Number in a Linked List 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 문제) 솔루션1) # Definition for singly-linked list..
알고리즘/LeetCode 2021. 12. 4. 15:58
LeetCode 풀기 - 1486. XOR Operation in an Array

1486. XOR Operation in an Array https://leetcode.com/problems/xor-operation-in-an-array/ XOR Operation in an 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 문제) 솔루션1) class Solution: def xorOperation(self, n: int, start: int) -> int: res = start for i in range(1, n): res ^=..
알고리즘/LeetCode 2021. 12. 2. 06:22
LeetCode 풀기 - 198. House Robber

198. House Robber https://leetcode.com/problems/house-robber/ House Robber - 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) - Dynamic Programming i번째 집에 도착했을 때 최대로 훔칠 수 있는 값을 구하는 것입니다. Intuition: 도둑이 순서대로 집을 털면서 i번째 도착했을 때 max를 구하는 문제 0번째 집에 도착했을 때는 nums[0] 1번째 집에 도착했을 때..
알고리즘/LeetCode 2021. 12. 2. 06:09
LeetCode 풀기 - 1329. Sort the Matrix Diagonally

1329. Sort the Matrix Diagonally https://leetcode.com/problems/sort-the-matrix-diagonally/ Sort the Matrix Diagonally - 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) - Straight Forward 특별한 자료구조나 알고리즘은 사용하지 않았습니다. 문제 그대로 이해하여 풀었습니다. 문제 풀이 접근: 오른쪽 상단을 시작으로 row++, col++ 이동..
알고리즘/LeetCode 2021. 12. 2. 05:55
Prev 1 ··· 12 13 14 15 16 17 18 ··· 25 Next