https://leetcode-cn.com/problems/median-of-two-sorted-arra

解決方案

Go 版本

func findMedianSortedArrays(nums1 []int, nums2 []int) float64 {len1,len2:=len(nums1) , len(nums2)len := len1+len2if len1>len2 {return findMedianSortedArrays(nums2,nums1) }if len1==0 {if len2 % 2 != 0 {return float64(nums2[len2/2])}else {return float64(nums2[len2/2-1] + nums2[len2/2])/2.0} }l:=0r:=len1for l<=r {cur1:=l + (r-l)/2cur2:=(len+1)/2 - cur1var L1,R1,L2,R2 int;if cur1==0 {L1 = -1e10}else{L1 = nums1[cur1-1]}if cur1==len1 {R1 = 1e10}else{R1 = nums1[cur1]}if cur2==0 {L2 = -1e10}else{L2 = nums2[cur2-1]}if cur2==len2 {R2 = 1e10}else{R2 = nums2[cur2]}if R1 < L2 {l = cur1 + 1} else if L1 > R2 {r = cur1 - 1}else {if len % 2 != 0 {return float64(max(L1,L2))}else{ return float64(max(L1,L2) + min(R1,R2))/2.0} }}return 0 }func max(a int ,b int ) int {if a>b {return a}return b }func min(a int , b int ) int {if a<b {return a}return b }

Java版本

class Solution {public double findMedianSortedArrays(int[] nums1, int[] nums2) {int len1 = nums1.length;int len2 = nums2.length;int len = len1 + len2;if (len1 > len2) {return findMedianSortedArrays(nums2, nums1);}if (len1 == 0) {if (len2 % 2 != 0) {return nums2[len2 / 2];} else {return (nums2[len2 / 2 - 1] + nums2[len2 / 2]) / 2.0;}}int l = 0;int r = len1;while (l <= r) {int cur1 = l + (r - l) / 2;int cur2 = (len + 1) / 2 - cur1;int L1, R1, L2, R2;L1 = cur1 == 0 ? Integer.MIN_VALUE : nums1[cur1 - 1];R1 = cur1 == len1 ? Integer.MAX_VALUE : nums1[cur1];L2 = cur2 == 0 ? Integer.MIN_VALUE : nums2[cur2 - 1];R2 = cur2 == len2 ? Integer.MAX_VALUE : nums2[cur2];if (R1 < L2) {l = cur1 + 1;} else if (L1 > R2) {r = cur1 - 1;} else {if (len % 2 != 0) {return Math.max(L1, L2);} else {return (Math.max(L1, L2) + Math.min(R1, R2)) / 2.0;}}}return 0;} }

參考文章

尋找兩個正序數組的中位數-官方題解

總結

以上是生活随笔為你收集整理的LeetCode 4 寻找两个正序数组的中位数的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。