Leetcode 2540. Minimum Common Value

Given two integer arrays nums1 and nums2, sorted in non-decreasing order, return the minimum integer common to both arrays. If there is no common integer amongst nums1 and nums2, return -1.

Note that an integer is said to be common to nums1 and nums2 if both arrays have at least one occurrence of that integer.

Example 1:

Input: nums1 = [1,2,3], nums2 = [2,4]Output: 2Explanation: The smallest element common to both arrays is 2, so we return 2.

Example 2:

Input: nums1 = [1,2,3,6], nums2 = [2,3,4,5]Output: 2Explanation: There are two common elements in the array 2 and 3 out of which 2 is the smallest, so 2 is returned.

Constraints:

• 1 <= nums1.length, nums2.length <= 105

• 1 <= nums1[i], nums2[j] <= 109

• Both nums1 and nums2 are sorted in non-decreasing order.

Accepted

21,559

Submissions

39,937

因为2个数组是已经排好序的，所以我们不需要去hashmap或者set去处理，只要从头开始去遍历即可的；

Easy题目；

Runtime: 2 ms, faster than 86.18% of Java online submissions for Minimum Common Value.

Memory Usage: 72.9 MB, less than 61.45% of Java online submissions for Minimum Common Value.