FilesExpand file tree

 master

/

LeetCode230_2.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

35 lines (31 loc) · 940 Bytes

 master

/

LeetCode230_2.java

Top

File metadata and controls

• Code
• Blame

35 lines (31 loc) · 940 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

package problems;

import java.util.ArrayList;

import java.util.List;

import java.util.Random;

public class LeetCode230_2 {

public int kthSmallest(TreeNode root, int k){

// 中序遍历生成数值列表

List<Integer> inorderList = new ArrayList<>();

inorder(root, inorderList);

return 0;

}

private void inorder(TreeNode node, List<Integer> inorderList){

if(node.left != null){

inorder(node.left, inorderList);

}

inorderList.add(node.val);

if(node.right != null){

inorder(node.right, inorderList);

}

}

private void shuffle(int[] arr){

Random random = new Random();

int length = arr.length;

for(int i = 0; i < length; i++) {

int randIndex = random.nextInt(length);

int temp = arr[i];

arr[i] = arr[randIndex];

arr[randIndex] = temp;

}

}

}