class Solution {
public double findMedianSortedArrays(int[] nums1, int[] nums2) {
if (nums1.length > nums2.length) {
return findMedianSortedArrays(nums2, nums1);
}
int m = nums1.length;
int n = nums2.length;
int left = 0, right = m;
int median1 = 0, median2 = 0;
while (left <= right) {
int i = (left + right) / 2;
int j = (m + n + 1) / 2 - i;
int nums_im1 = (i == 0 ? Integer.MIN_VALUE : nums1[i - 1]);
int nums_i = (i == m ? Integer.MAX_VALUE : nums1[i]);
int nums_jm1 = (j == 0 ? Integer.MIN_VALUE : nums2[j - 1]);
int nums_j = (j == n ? Integer.MAX_VALUE : nums2[j]);
if (nums_im1 <= nums_j) {
median1 = Math.max(nums_im1, nums_jm1);
median2 = Math.min(nums_i, nums_j);
left = i + 1;
} else {
right = i - 1;
}
}
return (m + n) % 2 == 0 ? (median1 + median2) / 2.0 : median1;
}
}
package leetcode;
public class tow {
public static void main(String[] args) {
int[] a = {1,3};
int[] b = {2,7};
System.out.println(a(a,b));
}
public static double a(int[] nums1,int[]nums2) {
int a = 0,b = 0,e=0,f=0,g=0,h=0,k=0;
double c = 0,d = 2;
c = ((double)nums1.length + (double)nums2.length)/2.0;
d = (nums1.length + nums2.length)/2;
System.out.println("d="+d+";c="+c+";n1="+nums1.length+";n2="+((double)nums2.length+nums1.length)/2);
if(c == d) {
System.out.println("----------3");
if(nums1.length==0) {
return (nums2[nums2.length/2]+nums2[nums2.length/2-1])/2.0;
}
if(nums2.length==0) {
return (nums1[nums1.length/2]+nums1[nums1.length/2-1])/2.0;
}
if(nums1[nums1.length-1]<nums2[0]) {
System.out.println("----------1");
if(nums1.length==nums2.length) {
return (nums1[nums1.length-1]+nums2[0])/2.0;
}
else {
return (nums2[1]+nums2[0])/2.0;
}
}
if(nums2[nums1.length-1]<nums1[0]) {
System.out.println("----------2");
if(nums1.length==nums2.length) {
return (nums1[nums1.length-1]+nums2[0])/2.0;
}
else {
return (nums1[1]+nums1[0])/2.0;
}
}
for (int i = 0; i <= (int)d; i++) {
System.out.println(a+"=="+b);
e = b(nums1[a],nums2[b]);
System.out.println(e);
if(e == 1||b==nums2.length-1) {
++b;
System.out.println("b="+b);
f=-1;
if(b==(int)d) {
b=1;
}
System.out.println("b="+b);
}
if(e == 0&&a!=nums1.length-1) {
++a;
f=1;
System.out.println("=a"+a);
if(a==(int)d) {
a=1;
}
System.out.println("=a"+a);
}
if(e == -1&&h==0&&k==0) {
++a;
h=1;
f=0;
k=1;
}
if(e == -1&&h==1&&k!=1) {
++b;
h=0;
f=0;
}
k=0;
if(i == (int)d-1) {
if(f==1) {
g=nums1[a-1];
}
if(f==0) {
g=nums1[a-1];
}
if(f==-1) {
g=nums2[b-1];
}
}
System.out.println("-----------5");
}
System.out.println("----------4"+f+nums1[a-1]+g);
if(f==1) {
return ((double)g+nums1[a])/2;
}
if(f==0) {
System.out.println("------------8");
return ((double)g+nums1[a])/2;
}
if(f==-1) {
System.out.println(a+"."+b+"g="+g+"num2="+nums2[b]);
return ((double)g+nums2[b])/2;
}
else {
return -9981;
}
}
if(c!=d) {
System.out.println("aaaaaaaaa");
if(nums1.length==0) {
return nums2[nums2.length/2];
}
if(nums2.length==0) {
return nums1[nums1.length/2];
}
if(nums1[nums1.length-1]<nums2[0]) {
if(nums1.length-1<(int)d) {
return nums2[(int)d-nums1.length];
}
else {
return nums1[(int)d];
}
}
if(nums2[nums2.length-1]<nums1[0]) {
if(nums2.length-1<(int)d) {
return nums1[(int)d-nums2.length];
}
else {
return nums2[(int)d];
}
}
for (int i = 0; i <= (int)d; i++) {
e = b(nums1[a],nums2[b]);
System.out.println(e);
if(e == 1) {
++b;
f=-1;
}
if(e == 0) {
++a;
f=1;
}
if(e == -1) {
++a;
++b;
f=0;
}
}
if(f==-1) {
return nums2[b-1];
}
if(f==1) {
return nums1[a-1];
}
if(f==0) {
return nums1[a-1];
}
}
return -9981;
}
public static int b(int b1,int b2) {
if(b1>b2) {
return 1;
}
if(b1<b2) {
return 0;
}
else{
return -1;
}
}
public double c(int[] nums1, int[] nums2) {
if (nums1.length > nums2.length) {
return c(nums2, nums1);
}
int m = nums1.length;
int n = nums2.length;
int left = 0, right = m;
int median1 = 0, median2 = 0;
while (left <= right) {
int i = (left + right) / 2;
int j = (m + n + 1) / 2 - i;
int nums_im1 = (i == 0 ? Integer.MIN_VALUE : nums1[i - 1]);
int nums_i = (i == m ? Integer.MAX_VALUE : nums1[i]);
int nums_jm1 = (j == 0 ? Integer.MIN_VALUE : nums2[j - 1]);
int nums_j = (j == n ? Integer.MAX_VALUE : nums2[j]);
if (nums_im1 <= nums_j) {
median1 = Math.max(nums_im1, nums_jm1);
median2 = Math.min(nums_i, nums_j);
left = i + 1;
} else {
right = i - 1;
}
}
return (m + n) % 2 == 0 ? (median1 + median2) / 2.0 : median1;
}
}