Commitdff065c

authored

Create 4-Median-of-Two-Sorted-Arrays.java

1 parent9ebcd6b commitdff065cCopy full SHA for dff065c

File tree

+20

-0

lines changed

+20

-0

lines changed

Lines changed: 20 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,20 @@`
	`1`	`+/Brute-force solution (Linear time)/`
	`2`	`+`
	`3`	`+classSolution {`
	`4`	`+publicdoublefindMedianSortedArrays(int[]nums1,int[]nums2) {`
	`5`	`+intm =nums1.length;`
	`6`	`+intn =nums2.length;`
	`7`	`+int[]nums =newint[m+n];`
	`8`	`+inti =0,j =0;`
	`9`	`+intk =0;`
	`10`	`+while (i<m &&j<n) {`
	`11`	`+if (nums1[i]<nums2[j])nums[k++] =nums1[i++];`
	`12`	`+elsenums[k++] =nums2[j++];`
	`13`	`+ }`
	`14`	`+for (;i<m;i++)nums[k++] =nums1[i];`
	`15`	`+for (;j<n;j++)nums[k++] =nums2[j];`
	`16`	`+if ((m+n)%2 ==0) {`
	`17`	`+return ((float)nums[(m+n-1)/2]+(float)nums[(m+n)/2])/(float)2;`
	`18`	`+ }elsereturn (float)nums[(m+n-1)/2];`
	`19`	`+ }`
	`20`	`+}`

Comments

(0)