기록하는 공간

Middle of the Linked List - LeetCode Middle of the Linked List - Given the head of a singly linked list, return the middle node of the linked list. If there are two middle nodes, return the second middle node. Example 1: [https://assets.leetcode.com/uploads/2021/07/23/lc-midlist1.jpg] Inpu leetcode.com # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None):..

Reverse Linked List - LeetCode Reverse Linked List - Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: [https://assets.leetcode.com/uploads/2021/02/19/rev1ex1.jpg] Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: [https://asset leetcode.com # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # sel..

Merge Two Sorted Lists - LeetCode Merge Two Sorted Lists - You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list. leetcode.com # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None):..

Is Subsequence - LeetCode Is Subsequence - Given two strings s and t, return true if s is a subsequence of t, or false otherwise. A subsequence of a string is a new string that is formed from the original string by deleting some (can be none) of the characters without disturbing th leetcode.com class Solution: def isSubsequence(self, s: str, t: str) -> bool: l, r = 0, 0 while l < len(s) and r < ..

Isomorphic Strings - LeetCode Isomorphic Strings - Given two strings s and t, determine if they are isomorphic. Two strings s and t are isomorphic if the characters in s can be replaced to get t. All occurrences of a character must be replaced with another character while preserving th leetcode.com class Solution: def isIsomorphic(self, s: str, t: str) -> bool: for a,b in zip(s, t): if s.index(a..

https://leetcode.com/problems/find-pivot-index/ class Solution: def pivotIndex(self, nums: List[int]) -> int: total_sum = sum(nums) for i in range(0, len(nums)): target = sum(nums[:i]) if target == (total_sum - nums[i] - target): return i return -1

https://leetcode.com/problems/running-sum-of-1d-array/ prefix sum 알고리즘을 활용한 문제 풀이 import copy class Solution: def runningSum(self, nums: List[int]) -> List[int]: sum_arr = [nums[0]] for i in range(1, len(nums)): sum_arr.append(sum_arr[i - 1] + nums[i]) return sum_arr

https://leetcode.com/problems/group-anagrams/ Group Anagrams - 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: def groupAnagrams(self, strs: List[str]) -> List[List[str]]: dicts = {} for s in strs: sorted_value = ''.join(sorted(s)) if sorted_value not in dicts: dict..

https://leetcode.com/problems/array-nesting/ Array Nesting - 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: def arrayNesting(self, nums: List[int]) -> int: result = 0 for index in range(0, len(nums)): length = 0 while nums[index] != -1: length += 1 temp = nums[inde..

https://leetcode.com/problems/two-sum/ Two 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 class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: res = [] dicts = {} for i in range(len(nums)): if (target - nums[i]) in dicts: value = dicts[target - nums[i..