목록알고리즘/LeetCode (177)

소프트웨어에 대한 모든 것

LeetCode 풀기 - 71. Simplify Path

71. Simplify Path https://leetcode.com/problems/simplify-path/ Simplify Path - 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 simplifyPath(self, path: str) -> str: # any multiple consecutive slashes (i.e. '//') are treated as a single slash '/' path =..
알고리즘/LeetCode 2022. 3. 15. 04:14
LeetCode 풀기 - 2. Add Two Numbers

2. Add Two Numbers https://leetcode.com/problems/add-two-numbers/ Add Two Numbers - 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) bruto-force 풀이 순서: 1) 리스트를 array 자료구조로 변환 2) carry를 계산하면서 각 자리수 add 3) 최종 결과물 array를 리스트로 변환해서 리턴 # Definition for singly-linked list. # cla..
알고리즘/LeetCode 2022. 3. 11. 06:33
LeetCode 풀기 - 2120. Execution of All Suffix Instructions Staying in a Grid

2120. Execution of All Suffix Instructions Staying in a Grid https://leetcode.com/problems/execution-of-all-suffix-instructions-staying-in-a-grid/ Execution of All Suffix Instructions Staying in a Grid - 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) brute force 시간복잡도 : ..
알고리즘/LeetCode 2022. 3. 10. 21:41
LeetCode 풀기 - 413. Arithmetic Slices

413. Arithmetic Slices https://leetcode.com/problems/arithmetic-slices/ Arithmetic Slices - 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 numberOfArithmeticSlices(self, nums: List[int]) -> int: """ Time Complexity : O(N^2) Space Complexity : O(1) """..
알고리즘/LeetCode 2022. 3. 9. 22:24
LeetCode 풀기 - 47. Permutations II

47. Permutations II https://leetcode.com/problems/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 문제) 솔루션1) 백트래킹 백트래킹 방식으로 순열을 한땀 한땀 구현합니다. class Solution: def permuteUnique(self, nums: List[int]) -> List[List[int]]: res = [] def recur(cur, remain..
알고리즘/LeetCode 2022. 3. 8. 07:27
LeetCode 풀기 - 2181. Merge Nodes in Between Zeros

2181. Merge Nodes in Between Zeros https://leetcode.com/problems/merge-nodes-in-between-zeros/ 문제) 솔루션1) # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def mergeNodes(self, head): cur = head.next cur_sum = 0 res = [] while cur: if cur.val == 0: res.append(cur_sum) cur_sum = 0 else: cur_sum += cur...
알고리즘/LeetCode 2022. 3. 4. 21:19
LeetCode 풀기 - 287. Find the Duplicate Number

287. Find the Duplicate Number https://leetcode.com/problems/find-the-duplicate-number/ Find the Duplicate 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 문제) 솔루션1) 정렬 정렬한 다음에 순차적으로 중복된 숫자를 찾습니다. class Solution: def findDuplicate(self, nums): nums = sorted(nums) for i in r..
알고리즘/LeetCode 2022. 3. 2. 20:10
LeetCode 풀기 - 34. Find First and Last Position of Element in Sorted Array

34. Find First and Last Position of Element in Sorted Array https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/ 문제) 솔루션1) binary search 풀이 순서: 1) 바이너리 서치로 target을 탐색 2) 찾은 target에서 왼쪽으로 인덱스를 이동하면서 동일한 target 값이 나올 때 까지 이동 (left idx) 3) 찾은 target에서 오른쪽 인덱스를 이동하면서 동일한 target 값이 나올 때 까지 이동 (right idx) 위 풀이는 결국 시간 복잡도 O(n)을 갖기 때문에 O(logn)을 만족하지 못 합니다. class Solutio..
알고리즘/LeetCode 2022. 2. 28. 15:44
Prev 1 ··· 4 5 6 7 8 9 10 ··· 23 Next