[LeetCode] 4. Median of Two Sorted Arrays
Python class Solution: def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float: nums = nums1 + nums2 nums.sort()...
최근 포스트
[LeetCode] 3. Longest Substring Without Repeating Characters
Python class Solution: def lengthOfLongestSubstring(self, s: str) -> int: answer = 0 temps = [] for i in s: if i i...
[LeetCode] 2. Add Two Numbers
Python # Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next...
[LeetCode] 680. Valid Palindrome II
Python class Solution: def validPalindrome(self, s: str) -> bool: left, right = 0, len(s) - 1 while left < right: if(s[...
[LeetCode] 58. Length of Last Word
Python class Solution: def lengthOfLastWord(self, s: str) -> int: temps = s.split() return len(temps[-1])