목록알고리즘/LeetCode (177)

소프트웨어에 대한 모든 것

6. Zigzag Conversion

6. Zigzag Conversion https://leetcode.com/problems/zigzag-conversion/description/ Zigzag Conversion - 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) numRows 수 만큼 배열을 생성해서 문자열을 순회하면서 배열에 아래로/위로 움직이면서 문자를 추가 class Solution: def convert(self, s: str, numRows: int) -> str: r..
알고리즘/LeetCode 2022. 12. 7. 08:20
462. Minimum Moves to Equal Array Elements II

https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii/ Minimum Moves to Equal Array Elements 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 462. Minimum Moves to Equal Array Elements II 문제) 솔루션1) 1) 오름차순 정렬 2) 중앙값 검색 3) 중앙값을 기준으로 각 elements에 대해서 move 계산 class..
알고리즘/LeetCode 2022. 7. 1. 06:21
5. Longest Palindromic Substring

5. Longest Palindromic Substring https://leetcode.com/problems/longest-palindromic-substring/ 문제) 솔루션1) middle 문자를 정하고 왼쪽, 오른쪽 포인터를 정해서 비교해서 동일한 문자면 한 칸씩 이동하면서 회문임을 확인한다. 시간 복잡도 : O(n*n) class Solution: def longestPalindrome(self, s: str) -> str: def get_palindrome(left, right): # 왼쪽, 오른쪽으로 이동하면서 회문을 탐색 while left >= 0 and right < len(s) and s[left] == s[right]: left -= 1 right += 1 return s[lef..
알고리즘/LeetCode 2022. 5. 24. 07:22
LeetCode 풀기 - 79. Word Search

79. Word Search https://leetcode.com/problems/word-search/ Word Search - 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 exist(self, board, word): m = len(board) n = len(board[0]) path = set() def bt(row, col, idx): if idx >= len(word): return Tru..
알고리즘/LeetCode 2022. 3. 30. 09:38
LeetCode 풀기 - 101. Symmetric Tree

101. Symmetric Tree https://leetcode.com/problems/symmetric-tree/ Symmetric 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) iterative 스태과 큐 두 개의 자료 구조를 준비 BFS를 적용하여 트리의 한 depth를 queue 자료 구조에 넣고 queue를 전체 pop해서 stack에 node를 추가 stack의 node의 value를 가운데를 기준으로 잘라서 대칭이 되..
알고리즘/LeetCode 2022. 3. 26. 22:14
LeetCode 풀기 - 328. Odd Even Linked List

328. Odd Even Linked List https://leetcode.com/problems/odd-even-linked-list/ Odd Even Linked List - 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. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next..
알고리즘/LeetCode 2022. 3. 26. 20:33
LeetCode 풀기 - 146. LRU Cache

146. LRU Cache https://leetcode.com/problems/lru-cache/ LRU Cache - 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) dict() dict() 자료 구조를 이용해서 쉽게 풀 수 있습니다. 참고적으로, python 3.7 이상 부터의 dict는 데이터의 삽입 순서를 보장합니다. Ordered dictionaries are just like regular dictionaries but have so..
알고리즘/LeetCode 2022. 3. 26. 15:00
LeetCode 풀기 - 895. Maximum Frequency Stack

895. Maximum Frequency Stack https://leetcode.com/problems/maximum-frequency-stack/ Maximum Frequency Stack - 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) 시간 초과 발생 시간 초과가 발생합니다. pop()을 수행할 때마다 sorted()로 정렬을 수행하기 때문에 너무 느립니다. push() 수행할 때 이미 정렬을 수행해 놓고 pop()에서는 O(1)으로 가..
알고리즘/LeetCode 2022. 3. 19. 23:01
Prev 1 ··· 3 4 5 6 7 8 9 ··· 23 Next