FilesExpand file tree

 master

/

LinkedList.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

74 lines (60 loc) · 1.57 KB

 master

/

LinkedList.java

Copy path

Top

File metadata and controls

• Code
• Blame

74 lines (60 loc) · 1.57 KB

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

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

package algorithm.node;

/**

* 得到一个自建的链表从头到尾的值分别是[1,2,3,4,5]

*/

public class LinkedList {

//头结点，只参与引用，算作链表数据之外的部分

private static Node head;

public static void initOrder() {

int size = 5;

Node temp = null;

Node tail = null;

for (int i = size; i > 0; i--) {

//尾巴

if (i == size) {

tail = new Node(i, null);

}

//中间部分

if (i < size && i != 1) {

if (temp == null) {

temp = new Node(i, tail);

} else {

temp = new Node(i, temp);

}

}

//头部

if (i == 1) {

head = new Node(i, temp);

}

}

}

/**

* 初始化无序链表

*/

public static void initNoOrder() {

int size = 5;

Node temp = null;

Node tail = null;

for (int i = size; i > 0; i--) {

//尾巴

if (i == size) {

tail = new Node(i, null);

}

//中间部分

if (i < size && i != 1) {

if (temp == null) {

temp = new Node(6, tail);

} else {

temp = new Node(6, temp);

}

}

//头部

if (i == 1) {

head = new Node(i, temp);

}

}

}

public static Node getHead() {

return head;

}

}