Commit 298bb38

committed

merge sort

1 parent 2815249 commit 298bb38Copy full SHA for 298bb38

File tree

-3

lines changed

-3

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -14,7 +14,7 @@`
`14`	`14`	`//acm测评风格,注意输入输出的处理`
`15`	`15`	`import java.util.Arrays;`
`16`	`16`
`17`		`-public class Code_0009_MergeSort {`
	`17`	`+public class Code_0001_MergeSort {`
`18`	`18`
`19`	`19`	`// merge sort的递归写法`
`20`	`20`	`public static void sort(int[] arr) {`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@`
`13`	`13`	`// TODO 方法2: 树状数组`
`14`	`14`	`// 小和问题是一个数右边有多少个数比它自己大`
`15`	`15`	`// 降序对问题就是求一个数右边有多少个数比它小,可以从右往左来算`
`16`		`-public class Code_0009_LeetCode_0493_ReversePairs {`
	`16`	`+public class Code_0002_LeetCode_0493_ReversePairs {`
`17`	`17`
`18`	`18`	`public static int reversePairs(int[] arr) {`
`19`	`19`	`if (null == arr \|\| arr.length <= 1) {`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,7 +13,7 @@`
`13`	`13`	`//给定一个数组arr,实现函数返回arr的"小和"`
`14`	`14`	`//测试链接 :`
`15`	`15`	`//https://www.nowcoder.com/practice/edfe05a1d45c4ea89101d936cac32469`
`16`		`-public class Code_0009_NowCoder_SmallSum {`
	`16`	`+public class Code_0003_NowCoder_SmallSum {`
`17`	`17`
`18`	`18`	`private static final int MAXN = 100001;`
`19`	`19`	`private static final int[] arr = new int[MAXN];`

Comments

(0)