Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"

Overview

It seems that coding tests are conducted overseas in interviews with engineers, and in many cases, the main thing is to implement specific functions and classes according to the theme.

Apparently, many engineers take measures on the site called LetCode.

It is a site that trains the algorithmic power that can withstand the coding test that is being done in the early story, and it is an inevitable path for those who want to build a career at an overseas tech company.

I wrote it in a big way, but I have no plans to have such an interview at the moment.

However, as an IT engineer, it would be better to have the same level of algorithm power as a person, so I would like to solve the problem irregularly and write down the method I thought at that time as a memo.

Leetcode

I'm solving it with Python3.

Leet Code Table of Contents Starting from Zero

Last time Leet Code Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero

Twitter I'm doing it.

** Technical Blog Started! !! ** ** I think the technology will write about LetCode, Django, Nuxt, and so on. ** This is faster to update **, so please bookmark it!

Notice

Posting on Qiita on Day 100 will be separated for the time being. I thought it would be nice if the articles with tags were all my articles, and I thought that it might get in the way of other people who are providing useful information, so I will do this. I decided to. There were many parts that could not be reached, but thank you for your cooperation so far.

I will continue to solve problems and write articles on the above personal blog, and if you are interested, I would be grateful if you could take a look there once in a while. Most of Twitter's accounts are for update notifications, so if you are interested in articles that solve Letcode, you may want to follow that as well.

problem

4. Median of Two Sorted Arrays The difficulty level is Hard.

The problem is that there are two sorted arrays nums1 and nums2 with sizes m and n. Find the median of the two sort arrays. Note that the overall execution time complexity must be ʻO (log (m + n)), and it may be assumed that neither nums1 nor nums2` is empty.

Example 1:

nums1 = [1, 3] nums2 = [2] The median is 2.0

Example 2:

nums1 = [1, 2] nums2 = [3, 4] The median is (2 + 3)/2 = 2.5

solution

Binary search can be used because it is ʻO (log (m + n))`. However, since the difficulty level is Hard, there are two lists to handle. This will increase the amount of code you write, and the more you write, the more likely you are to make mistakes. And both aren't necessarily the same size list, so keep that in mind.

class Solution:
    def obtain_kth_num(self, nums1, nums2, k):
        nums1_len, nums2_len = len(nums1), len(nums2)
        nums1 = [-2**31] + nums1 + [2**31-1]
        nums2 = [-2**31] + nums2 + [2**31-1]
        left, right = max(0, k-nums2_len), min(nums1_len, k)
        while left <= right:
            i = (left+right) // 2
            j = k - i
            if nums1[i] > nums2[j+1]:
                right = i - 1
            elif nums2[j] > nums1[i+1]:
                left = i + 1
            else:
                return max(nums1[i], nums2[j])
            
    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
        nums_len = len(nums1) + len(nums2)
        mid = self.obtain_kth_num(nums1, nums2, (nums_len+1)//2)
        if nums_len % 2 == 0:
            mid = (mid+self.obtain_kth_num(nums1, nums2, (nums_len+1)//2+1)) / 2.0
        return mid
# Runtime: 116 ms, faster than 35.51% of Python3 online submissions for Median of Two Sorted Arrays.
# Memory Usage: 13.9 MB, less than 92.38% of Python3 online submissions for Median of Two Sorted Arrays.

As with DFS, we implemented a separate function and then called it in the main. I think I explained before that -2 ** 31 and 2 ** 31-1 use this method because there is no long type in Python3.

The ʻobtain_kth_numfunction takes the givennums1 and num2` as input and returns the kth smallest number in the array.

In addition, I referred to this video for the basic idea in binary search. I want to be strong enough to make videos like this ...

So that's it for this time. Thank you for your hard work.

Recommended Posts

Let Code Day92 Starting from Zero "4. Median of Two Sorted Arrays"
Let Code Day24 Starting from Zero "21. Merge Two Sorted Lists"
Let Code Day 35 "160. Intersection of Two Linked Lists" Starting from Zero
Let Code Day 44 "543. Diameter of Binary Tree" starting from zero
Let Code Day12 Starting from Zero "617. Merge Two Binary Trees"
Let Code Day70 Starting from Zero "295. Find Median from Data Stream"
Let Code Day48 Starting from Zero "26. Remove Duplicates from Sorted Array"
Let Code Day87 Starting from Zero "1512. Number of Good Pairs"
Let Code Day56 Starting from Zero "5453. Running Sum of 1d Array"
Let Code Day7 starting from zero "104. Maximum Depth of Binary Tree"
Let Code Day86 Starting from Zero "33. Search in Rotated Sorted Array"
Let Code Day16 Starting from Zero "344. Reverse String"
Let Code Day49 starting from zero "1323. Maximum 69 Number"
Let Code Day89 "62. Unique Paths" Starting from Zero
Let Code Day 55 "22. Generate Parentheses" Starting from Zero
Let Code Table of Contents Starting from Zero
Let Code Day18 starting from zero "53. Maximum Subarray"
Let Code Day 13 "338. Counting Bits" Starting from Zero
Let Code Day71 Starting from Zero "1496. Path Crossing"
Let Code Day 61 "7. Reverse Integer" starting from zero
Let Code Day 82 "392. Is Subsequence" Starting from Zero
Let Code Day51 Starting from Zero "647. Palindromic Substrings"
Let Code Day 50 "739. Daily Temperatures" Starting from Zero
Let Code Day 15 "283. Move Zeroes" starting from zero
Let Code Day14 starting from zero "136. Single Number"
Let Code Day 33 "1. Two Sum" starting from scratch
Let Code Day 91 "153. Find Minimum in Rotated Sorted Array" starting from zero
Let Code Day 11 Starting from Zero "1315. Sum of Nodes with Even-Valued Grandparent"
Let Code Day6 Starting from Zero "1342. Number of Steps to Reduce a Number to Zero"
Let Code Day 43 "5. Longest Palindromic Substring" Starting from Zero
Let Code Day74 starting from zero "12. Integer to Roman"
Let Code Day57 Starting from Zero "35. Search Insert Position"
Let Code Day47 Starting from Zero "14. Longest Common Prefix"
Let Code Day78 Starting from Zero "206. Reverse Linked List"
Let Code Day52 Starting from Zero "1351. Count Negative Numbers in a Sorted Matrix"
Let Code Day10 Starting from Zero "1431. Kids With the Greatest Number of Candies"
Let Code Day 64 starting from zero "287. Find the Duplicate Number"
Let Code Day 84 starting from zero "142. Linked List Cycle II"
Let Code Day2 Starting from Zero "1108. Defanging an IP Address"
Let Code Day81 "347. Top K Frequent Elements" Starting from Zero
Let Code Day4 starting from scratch "938. Range Sum of BST"
Let Code Day 60 starting from zero "1481. Least Number of Unique Integers after K Removals"
Let Code Day75 starting from scratch "15.3 Sum"
Let Code Day 29 "46. Permutations" starting from scratch
Let Code Day67 Starting from Zero "1486. XOR Operation in an Array"
Let Code Day5 starting from zero "1266. Minimum Time Visiting All Points"
Let Code Day83 Starting from Zero "102. Binary Tree Level Order Traversal"
Let Code Day72 Starting from Zero "1498. Number of Subsequences That Satisfy the Given Sum Condition"
Let Code Day 62 "83. Remove Duplicates from Sorted List"
Let Code Day 41 "394. Decode String" starting from scratch
Let Code Day 25 "70. Climbing Stairs" starting from scratch
Let Code Day69 starting from scratch "279. Perfect Squares"
Let Code Day 34 starting from scratch "118. Pascal's Triangle"
Let Code Day85 starting from scratch "6. ZigZag Conversion"
Let Code Day20 starting from scratch "134. Gas Station"
Let Code Day 88 "139. Word Break" starting from scratch
Let Code Day 28 "198. House Robber" starting from scratch
Let Code Day 39 "494. Target Sum" starting from scratch
Let Code Day 36 "155. Min Stack" starting from scratch
Let Code Day 17 "169. Majority Element" starting from scratch
Let Code Day 40 Starting from Zero "114. Flatten Binary Tree to Linked List"