Commit a6e5276

committed

feat: add test code

1 parent d301eda commit a6e5276Copy full SHA for a6e5276

File tree

-3

lines changed

-3

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -7,6 +7,7 @@`
`7`	`7`	`* desc : 冒泡排序`
`8`	`8`	`* </pre>`
`9`	`9`	`*/`
	`10`	`+`
`10`	`11`	`public class BubbleSort implements ISort {`
`11`	`12`
`12`	`13`	`@Override`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -150,8 +150,8 @@ class Solution {`
`150`	`150`	`}`
`151`	`151`
`152`	`152`	`private final int getRootIndex(int[] inorder, int key) {`
`153`		`- for (int i = 0; i < preorder.length; i++) {`
`154`		`- if (preorder[i] == key) {`
	`153`	`+ for (int i = 0; i < inorder.length; i++) {`
	`154`	`+ if (inorder[i] == key) {`
`155`	`155`	`return i;`
`156`	`156`	`}`
`157`	`157`	`}`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -76,7 +76,7 @@ class Solution {`
`76`	`76`	`int right = numbers.length - 1;`
`77`	`77`
`78`	`78`	`while (left < right) {`
`79`		`- int mid = (left + right) >>> 2;`
	`79`	`+ int mid = (left + right) >>> 1;`
`80`	`80`	`if (numbers[mid] < numbers[right]) {`
`81`	`81`	`right = mid;`
`82`	`82`	`} else if (numbers[mid] > numbers[right]) {`

Comments

(0)