Commit45a57d0

committed

refactor 4

1 parent0dd40b3 commit45a57d0Copy full SHA for 45a57d0

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -22,7 +22,7 @@ The median is (2 + 3)/2 = 2.5`
`22`	`22`	`*/`
`23`	`23`	`publicclass_4 {`
`24`	`24`
`25`		`-classSolution1 {`
	`25`	`+publicstaticclassSolution1 {`
`26`	`26`	`/**credit: https://discuss.leetcode.com/topic/28602/concise-java-solution-based-on-binary-search`
`27`	`27`	`*`
`28`	`28`	`* The key point of this problem is to ignore half part of A and B each step recursively by comparing the median of remaining A and B:`
`@@ -68,7 +68,7 @@ public double getkth(int[] A, int aStart, int[] B, int bStart, int k) {`
`68`	`68`	`}`
`69`	`69`	`}`
`70`	`70`
`71`		`-classSolution2 {`
	`71`	`+publicstaticclassSolution2 {`
`72`	`72`	`/**`
`73`	`73`	`* Reference: https://leetcode.com/discuss/28843/my-accepted-java-solution:`
`74`	`74`	`* Basic Idea is very similar to K-selection. it's easier to understand if you imagine this to be chopping off the last K elements from a total of len(A) + len(B) elements,`

Comments

(0)