@JimHYC

4. Median of Two Sorted Arrays

Jun 10, 2022 · 1 min read · Problem Link class Solution: def findMedianSortedArrays(self, A: List[int], B: List[int]) -> float: if len(A) > len(B): return self.findMedianSortedArrays(B, A) La, Lb = len(A), len(B) total = La + Lb h...

321. Create Maximum Number

Jun 9, 2022 · 1 min read · Problem Link class Solution: def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]: res = [] lower = max(0, k - len(nums2)) # pick all elements from nums2 upper = min(k, len(nums1)) # pick all elemen...

386. Lexicographical Numbers

Jun 8, 2022 · 1 min read · Problem Link Given an integer n, return all the numbers in the range [1, n] sorted in lexicographical order. Example: Input: n = 32 Output: [1,10,11,12,13,14,15,16,17,18,19,2,20,21,22,23,24,25,26,27,28,29,3,30,31,32,4,5,6,7,8,9] class Solution: ...

220. Contains Duplicate III

Jun 7, 2022 · 1 min read · Problem Link Given an integer array nums and two integers k and t, return true if there are two distinct indices i and j in the array such that abs(nums[i] - nums[j]) <= t and abs(i - j) <= k. Solution Bucket size: t + 1 class Solution: def c...

1139. Largest 1-Bordered Square

Jun 6, 2022 · 1 min read · Problem Link Let dpVer[i][j] := the number of continuous 1’s from grid[0][j-1] to grid[i-1][j-1] Let dpHor[i][j] := the number of continuous 1’s from grid[i-1][0] to grid[i-1][j-1] class Solution: def largest1BorderedSquare(self, grid: List[List[...