Commit 2815249

committed

quick sort

1 parent ef739c2 commit 2815249Copy full SHA for 2815249

File tree

-3

lines changed

-3

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`	`// 荷兰国旗问题`
`5`	`5`	`// 仅0,1,2,所有的0放左边,所有的1放中间,所有的2放右边`
`6`	`6`	`// https://leetcode.com/problems/sort-colors/`
`7`		`-public class Code_0010_LeetCode_0075_SortColors {`
	`7`	`+public class Code_0001_LeetCode_0075_SortColors {`
`8`	`8`	`public static void sortColors(int[] arr) {`
`9`	`9`	`int l = -1; // 0 ~ l 是小于区域`
`10`	`10`	`int r = arr.length; // l ~ r 是等于区域 , r ~ arr.length - 1 是大于区域`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,7 @@`
`19`	`19`	`// 4)那么所有情况都考虑,时间复杂度就是这种概率模型下的长期期望!`
`20`	`20`	`// 时间复杂度O(N*logN),额外空间复杂度O(logN)都是这么来的。`
`21`	`21`	`// 测评链接:https://www.lintcode.com/problem/464`
`22`		`-public class Code_0010_QuickSort {`
	`22`	`+public class Code_0002_QuickSort {`
`23`	`23`	`public static void sortIntegers2(int[] arr) {`
`24`	`24`	`if (arr == null \|\| arr.length <= 1) {`
`25`	`25`	`return;`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@`
`17`	`17`	`* <p>`
`18`	`18`	`* 方法2. bfprt算法 (严格收敛到O(N),但是空间复杂度O(N))`
`19`	`19`	`*/`
`20`		`-public class Code_0010_LeetCode_0215_KthLargestElementInAnArray {`
	`20`	`+public class Code_0003_LeetCode_0215_KthLargestElementInAnArray {`
`21`	`21`	`public static void main(String[] args) {`
`22`	`22`	`int[] arr = { -1, -1 };`
`23`	`23`	`System.out.println(findKthLargest(arr, 2));`

Comments

(0)