Java数据结构和算法--链表

(1)简单链表

Java代码

1. packageChapterFive;
3. classLink<E>{
5. publicEdata;
7. publicLink<E>next;
9. publicLink(Edata){
10. this.data=data;
11. }
12. }
14. classLinkList<E>{
16. publicLink<E>first;
17. //链表中数据项的个数
18. publicintsize;
20. publicLinkList(){
21. first=null;
22. size=0;
23. }
24. //在表头插入新的数据
25. publicvoidinsertFirst(Evalue){
26. Link<E>link=newLink<E>(value);
27. link.next=first;
28. first=link;
29. size++;
30. }
31. //判断链表是否为空
32. publicbooleanisEmpty(){
33. returnsize==0;
34. }
35. //删除表头
36. publicLink<E>deleteFirst(){
37. Link<E>temp=first;
38. first=first.next;
39. size--;
40. returntemp;
41. }
42. //输出链表中的所有数据
43. publicvoiddisplay(){
44. Link<E>curr=first;
45. while(curr!=null){
46. System.out.print(curr.data+"");
47. curr=curr.next;
48. }
49. System.out.println();
50. }
51. //返回链表中数据项的个数
52. publicintsize(){
53. returnsize;
54. }
55. //获取从头至尾的第i个数据项
56. publicLink<E>get(inti){
57. if(i>size()-1||i<0)
58. try{
59. thrownewIndexOutOfBoundsException();
60. }catch(Exceptione){
61. e.printStackTrace();
62. }
63. Link<E>curr=first;
64. for(intn=0;n<size();n++){
65. if(n==i)
66. returncurr;
67. else
68. curr=curr.next;
69. }
70. returnnull;
71. }
72. //输出从头至尾的第i个数据项
73. publicvoidremove(inti){
74. if(i==0)
75. deleteFirst();
76. elseif(i==size()-1)
77. get(i-1).next=null;
78. else{
79. get(i-1).next=get(i+1);
80. }
81. size--;
82. }
83. }
85. publicclassLink_list{
86. publicstaticvoidmain(String[]args){
87. LinkList<Long>ll=newLinkList<Long>();
88. for(inti=0;i<10;i++){
89. Longvalue=(long)(Math.random()*100);
90. ll.insertFirst(value);
91. }
92. ll.display();
93. while(!ll.isEmpty()){
94. ll.deleteFirst();
95. ll.display();
96. }
97. System.out.println("Ok");
98. }
99. }

package ChapterFive;

class Link<E> {

	public E data;

	public Link<E> next;

	public Link(E data) {
		this.data = data;
	}
}

class LinkList<E> {

	public Link<E> first;
	//链表中数据项的个数
	public int size;

	public LinkList() {
		first = null;
		size = 0;
	}
	//在表头插入新的数据
	public void insertFirst(E value) {
		Link<E> link = new Link<E>(value);
		link.next = first;
		first = link;
		size++;
	}
	//判断链表是否为空
	public boolean isEmpty() {
		return size == 0;
	}
	//删除表头
	public Link<E> deleteFirst() {
		Link<E> temp = first;
		first = first.next;
		size--;
		return temp;
	}
	//输出链表中的所有数据
	public void display() {
		Link<E> curr = first;
		while (curr != null) {
			System.out.print(curr.data + " ");
			curr = curr.next;
		}
		System.out.println();
	}
	//返回链表中数据项的个数
	public int size() {
		return size;
	}
	//获取从头至尾的第i个数据项
	public Link<E> get(int i) {
		if (i > size() - 1 || i < 0)
			try {
				throw new IndexOutOfBoundsException();
			} catch (Exception e) {
				e.printStackTrace();
			}
		Link<E> curr = first;
		for (int n = 0; n < size(); n++) {
			if (n == i)
				return curr;
			else
				curr = curr.next;
		}
		return null;
	}
	//输出从头至尾的第i个数据项
	public void remove(int i) {
		if (i == 0)
			deleteFirst();
		else if (i == size() - 1)
			get(i - 1).next = null;
		else {
			get(i - 1).next = get(i + 1);
		}
		size--;
	}
}

public class Link_list {
	public static void main(String[] args) {
		LinkList<Long> ll = new LinkList<Long>();
		for (int i = 0; i < 10; i++) {
			Long value = (long) (Math.random() * 100);
			ll.insertFirst(value);
		}
		ll.display();
		while (!ll.isEmpty()) {
			ll.deleteFirst();
			ll.display();
		}
		System.out.println("Ok");
	}
}

(2)链栈

Java代码

1. packageChapterFive;
3. classLinkStack<E>{
5. LinkList<E>linkList;
7. intsize;
9. publicLinkStack(){
10. size=0;
11. linkList=newLinkList<E>();
12. }
13. //入栈
14. publicvoidpush(Evalue){
15. linkList.insertFirst(value);
16. size++;
17. }
18. //出栈
19. publicLink<E>pop(){
20. size--;
21. returnlinkList.deleteFirst();
22. }
23. //返回栈顶元素
24. publicLink<E>top(){
25. returnlinkList.first;
26. }
27. //判断栈是否为空
28. publicbooleanisEmpty(){
29. returnsize==0;
30. }
31. //显示栈中的全部数据
32. publicvoiddisplay(){
33. linkList.display();
34. }
35. }
37. publicclassLink_stack{
38. publicstaticvoidmain(String[]args){
39. LinkStack<Long>ls=newLinkStack<Long>();
40. for(inti=0;i<10;i++){
41. Longvalue=newLong((long)(Math.random()*100));
42. ls.push(value);
43. }
44. while(!ls.isEmpty()){
45. ls.pop();
46. ls.display();
47. }
48. System.out.println("Ok");
49. }
50. }

package ChapterFive;

class LinkStack<E> {

	LinkList<E> linkList;

	int size;

	public LinkStack() {
		size = 0;
		linkList = new LinkList<E>();
	}
	//入栈
	public void push(E value) {
		linkList.insertFirst(value);
		size++;
	}
	//出栈
	public Link<E> pop() {
		size--;
		return linkList.deleteFirst();
	}
	//返回栈顶元素
	public Link<E> top() {
		return linkList.first;
	}
	//判断栈是否为空
	public boolean isEmpty() {
		return size == 0;
	}
	//显示栈中的全部数据
	public void display() {
		linkList.display();
	}
}

public class Link_stack {
	public static void main(String[] args) {
		LinkStack<Long> ls = new LinkStack<Long>();
		for (int i = 0; i < 10; i++) {
			Long value = new Long((long) (Math.random() * 100));
			ls.push(value);
		}
		while (!ls.isEmpty()) {
			ls.pop();
			ls.display();
		}
		System.out.println("Ok");
	}
}

(3)有序表

Java代码

1. packageChapterFive;
3. classSortedLink{
5. publicLink<Long>first;
7. intsize;
9. publicSortedLink(){
10. first=null;
11. size=0;
12. }
13. //向有序链表中插入数据
14. publicvoidinsert(longvalue){
15. Link<Long>newLink=newLink<Long>(value);
16. Link<Long>previous=null;
17. Link<Long>curr=first;
18. while(curr!=null&&(value>curr.data)){
19. previous=curr;
20. curr=curr.next;
21. }
22. if(previous==null)//链表为空(在表头插入)
23. first=newLink;
24. else
25. previous.next=newLink;//插入新的节点
26. newLink.next=curr;
27. size++;
28. }
29. //删除第一个节点
30. publicLink<Long>remove(){
31. Link<Long>temp=first;
32. first=first.next;
33. size--;
34. returntemp;
35. }
36. //判断链表是否为空
37. publicbooleanisEmpty(){
38. returnsize==0;
39. }
40. //输出链表的所有数据
41. publicvoiddisplay(){
42. Link<Long>curr=first;
43. while(curr!=null){
44. System.out.print(curr.data+"");
45. curr=curr.next;
46. }
47. System.out.println();
48. }
49. }
51. publicclassSortedLinkApp{
52. publicstaticvoidmain(String[]args){
53. SortedLinksl=newSortedLink();
54. for(inti=0;i<10;i++){
55. sl.insert((long)(Math.random()*100));
56. }
57. while(!sl.isEmpty()){
58. sl.remove();
59. sl.display();
60. }
61. }
62. }

package ChapterFive;

class SortedLink {

	public Link<Long> first;

	int size;

	public SortedLink() {
		first = null;
		size = 0;
	}
	//向有序链表中插入数据
	public void insert(long value) {
		Link<Long> newLink = new Link<Long>(value);
		Link<Long> previous = null;
		Link<Long> curr = first;
		while (curr != null && (value > curr.data)) {
			previous = curr;
			curr = curr.next;
		}
		if (previous == null)// 链表为空(在表头插入)
			first = newLink;
		else
			previous.next = newLink;//插入新的节点
		newLink.next = curr;
		size++;
	}
	//删除第一个节点
	public Link<Long> remove() {
		Link<Long> temp = first;
		first = first.next;
		size--;
		return temp;
	}
	//判断链表是否为空
	public boolean isEmpty() {
		return size == 0;
	}
	//输出链表的所有数据
	public void display() {
		Link<Long> curr = first;
		while (curr != null) {
			System.out.print(curr.data + " ");
			curr = curr.next;
		}
		System.out.println();
	}
}

public class SortedLinkApp {
	public static void main(String[] args) {
		SortedLink sl = new SortedLink();
		for (int i = 0; i < 10; i++) {
			sl.insert((long) (Math.random() * 100));
		}
		while (!sl.isEmpty()) {
			sl.remove();
			sl.display();
		}
	}
}

(4)双向链表

Java代码

1. packageChapterFive;
3. classDoubleLink<E>{
5. publicLink<E>first;
7. publicLink<E>last;
9. intsize;
11. @SuppressWarnings("hiding")
12. classLink<E>{
13. publicEdata;
15. publicLink<E>next;//链表的下一项
17. publicLink<E>previous;//链表的前一项
19. publicLink(Evalue){
20. this.data=value;
21. }
22. }
24. publicDoubleLink(){
25. first=null;
26. last=null;
27. size=0;
28. }
30. //在链表的首部插入一项
31. publicvoidinsertFirst(Evalue){
32. Link<E>newLink=newLink<E>(value);
33. if(isEmpty())//如果链表为空则first==last
34. last=newLink;
35. else
36. first.previous=newLink;//确定原first与newLink的前后关系
37. newLink.next=first;
38. first=newLink;//设置新的first值
39. size++;
40. }
42. //在链表的尾部插入一项
43. publicvoidinsertLast(Evalue){
44. Link<E>newLink=newLink<E>(value);
45. if(isEmpty())//如果链表为空则last==first
46. first=newLink;
47. else{
48. last.next=newLink;//确定原last与newLink的前后关系
49. newLink.previous=last;
50. }
51. last=newLink;//设置新的last值
52. size++;
53. }
55. //删除双向链表的表头
56. publicLink<E>deleteFirst(){
57. Link<E>temp=first;
58. if(first.next==null)//链表中只有一项数据
59. last=null;
60. else
61. first.next.previous=null;//销毁原链表的头部
62. first=first.next;
63. size--;
64. returntemp;
65. }
67. //删除链表的最后一项
68. publicLink<E>deleteLast(){
69. Link<E>temp=last;
70. if(first.next==null)//链表中只有一项数据
71. first=null;
72. else
73. last.previous.next=null;//销毁原链表的尾部
74. last=last.previous;
75. size--;
76. returntemp;
77. }
79. //判断链表是否为空
80. publicbooleanisEmpty(){
81. returnsize==0;
82. }
84. //输出链表中的所有数据项
85. publicvoiddisplay(){
86. Link<E>curr=first;
87. while(curr!=null){
88. System.out.print(curr.data+"");
89. curr=curr.next;
90. }
91. System.out.println();
92. }
93. }
95. publicclassDoubleLinkApp{
96. publicstaticvoidmain(String[]args){
97. DoubleLink<Integer>dl=newDoubleLink<Integer>();
98. for(inti=0;i<5;i++){
99. dl.insertFirst((int)(Math.random()*100));
100. }
101. for(inti=0;i<5;i++){
102. dl.insertLast((int)(Math.random()*100));
103. }
104. dl.display();
105. while(!dl.isEmpty()){
106. dl.deleteFirst();
107. dl.deleteLast();
108. dl.display();
109. }
110. System.out.println("Ok");
111. }
112. }