第四节 线性表的链式结构——链表
1. 链表的定义
链表 (Linked list)是一种常见的基础数据结构,是一种线性表,但是并不会按线性的顺序存储数据,而是在每一个节点里存到下一个节点的指针(Pointer)。
使用链表结构可以克服数组链表需要预先知道数据大小的缺点,链表结构可以充分利用计算机内存空间,实现灵活的内存动态管理。但是链表失去了数组随机读取的优点,同时链表由于增加了结点的指针域,空间开销比较大。
2. 单向链表
(1)单向链表的定义
单链表是链表中结构最简单的。一个单链表的 节点(Node) 分为两个部分,第一个部分 数据域(data) 保存或者显示关于节点的信息,另一个部分为 指针域(next) 存储下一个节点的地址。最后一个节点存储地址的部分指向空值。
单向链表只可向一个方向遍历,一般查找一个节点的时候需要从第一个节点开始每次访问下一个节点,一直访问到需要的位置。而插入一个节点,对于单向链表,我们只提供在链表头插入,只需要将当前插入的节点设置为头节点,next指向原头节点即可。删除一个节点,我们将该节点的上一个节点的next指向该节点的下一个节点。
(2)单向链表的代码实现
package p3.linked;
import p1.interfaces.List;
import java.util.Comparator;
import java.util.Iterator;
public class LinkedSingleList<E> implements List<E> {
//定义结点对象
private class Node {
E data; //数据域
Node next; //指针域
public Node(){
this(null,null);
}
public Node(E data) {
this(data,null);
}
public Node(E data, Node next) {
this.data = data;
this.next = next;
}
@Override
public String toString() {
return data.toString();
}
}
private Node head; //头指针
private Node tail; //尾指针
private int size; //元素的个数
public LinkedSingleList() {
head = null;
tail = null;
size = 0;
}
public LinkedSingleList(E[] arr) {
if (arr == null || arr.length == 0) {
throw new IllegalArgumentException("arr is null");
}
for (int i = 0; i < arr.length; i++) {
add(arr[i]);
}
}
@Override
public void add(E element) {
add(size, element);
}
@Override
public void add(int index, E element) {
if (index < 0 || index > size) {
throw new IllegalArgumentException("add index out of range");
}
Node n = new Node(element);
if (size == 0) {
head = n;
tail = n;
} else if (index == 0) {
n.next = head;
head = n;
} else if (index == size) {
tail.next = n;
tail = n;
} else {
Node p = head;
for (int i = 0; i < index - 1; i++) {
p = p.next;
}
n.next = p.next;
p.next = n;
}
size++;
}
@Override
public void remove(E element) {
int index = indexOf(element);
if (index != -1) {
remove(index);
}
}
@Override
public E remove(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("remove index out of range");
}
E ret = null;
if (size == 1) {
ret = head.data;
head = null;
tail = null;
} else if (index == 0) {
Node n = head;
ret = n.data;
head = n.next;
n.next = null;
} else if (index == size - 1) {
Node p = head;
while (p.next != tail) {
p = p.next;
}
ret = tail.data;
p.next = null;
tail = p;
} else {
Node p = head;
for (int i = 0; i < index - 1; i++) {
p = p.next;
}
Node n = p.next;
ret = n.data;
p.next = n.next;
n.next = null;
}
size--;
return ret;
}
@Override
public E get(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("get index out of range");
}
if (index == 0) {
return head.data;
} else if (index == size - 1) {
return tail.data;
} else {
Node p = head;
for (int i = 0; i < index; i++) {
p = p.next;
}
return p.data;
}
}
@Override
public E set(int index, E element) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("get index out of range");
}
E ret = null;
if (index == 0) {
ret = head.data;
head.data = element;
} else if (index == size - 1) {
ret = tail.data;
tail.data = element;
} else {
Node p = head;
for (int i = 0; i < index; i++) {
p = p.next;
}
ret = p.data;
p.data = element;
}
return ret;
}
@Override
public int size() {
return size;
}
@Override
public int indexOf(E element) {
Node p = head;
int index = 0;
while (!p.data.equals(element)) {
p = p.next;
index++;
if (p == null) {
return -1;
}
}
return index;
}
@Override
public boolean contains(E element) {
return indexOf(element) != -1;
}
@Override
public boolean isEmpty() {
return size == 0 && head == null && tail == null;
}
@Override
public void clear() {
head = null;
tail = null;
size = 0;
}
@Override
public void sort(Comparator<E> c) {
if (c == null) {
throw new IllegalArgumentException("comparator can not be null");
}
//此处的插入排序O(n^3)
/*
for (int i = 1; i < size; i++) {
E e = get(i);
int j = 0;
for (j = i; j > 0 && c.compare(get(j - 1), e) > 0; j--) {
set(j, get(j - 1));
}
set(j, e);
}
*/
if (size == 0 || size == 1) {
return;
}
Node nodeA = head;
Node nodeB = nodeA.next;
while (true) {
while (true) {
if (c.compare(nodeA.data, nodeB.data) > 0) {
swap(nodeA, nodeB);
}
if (nodeB == tail) {
break;
}
nodeB = nodeB.next;
}
if (nodeA.next == tail) {
break;
}
nodeA = nodeA.next;
nodeB = nodeA.next;
}
}
private void swap(Node nodeA, Node nodeB) {
E temp = nodeA.data;
nodeA.data = nodeB.data;
nodeB.data = temp;
}
@Override
public List<E> subList(int fromIndex, int toIndex) {
//0 <= fromIndex <= toIndex <= size - 1 [fromIndex,toIndex]
if (fromIndex < 0 || toIndex >= size || fromIndex > toIndex) {
throw new IllegalArgumentException("must 0 <= fromIndex <= toIndex <= size - 1");
}
LinkedSingleList<E> list = new LinkedSingleList<>();
/*
for (int i = fromIndex; i <= toIndex; i++) { //O(M)
list.add(get(i)); //O(N) * O(M) = O(NM) ~ O(N^2)
}
*/
Node nodeA = head;
for (int i = 0; i < fromIndex; i++) {
nodeA = nodeA.next;
}
Node nodeB = head;
for (int i = 0; i < toIndex; i++) {
nodeB = nodeB.next;
}
Node p = nodeA;
while (true) {
list.add(p.data);
if (p == nodeB) {
break;
}
p = p.next;
}
return list;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
if (isEmpty()) {
sb.append(']');
} else {
Node p = head;
while (true) {
sb.append(p.data);
if (p == tail) {
sb.append(']');
break;
}
sb.append(',');
sb.append(' ');
p = p.next;
}
}
return sb.toString();
}
@Override
public Iterator<E> iterator() {
return new LinkedSinglyListIterator();
}
class LinkedSinglyListIterator implements Iterator<E> {
private Node cur = head;
@Override
public boolean hasNext() {
return cur != null;
}
@Override
public E next() {
E ret = cur.data;
cur = cur.next;
return ret;
}
}
}
3. 单向循环链表
(1)单项循环链表的定义
如果把单链表的最后一个节点的指针指向链表头部,而不是指向NULL,那么就构成了一个 单向循环链表
(2)代码实现:
package p3.linked;
import p1.interfaces.List;
import java.util.Comparator;
import java.util.Iterator;
public class LinkedSingleLoopList<E> implements List<E> {
private class Node {
E data; //数据域
Node next; //指针域
public Node(){
this(null,null);
}
public Node(E data) {
this(data,null);
}
public Node(E data, Node next) {
this.data = data;
this.next = next;
}
@Override
public String toString() {
return data.toString();
}
}
private Node head; //头指针
private Node tail; //尾指针
private int size; //元素的个数
public LinkedSingleLoopList() {
head = null;
tail = null;
size = 0;
}
public LinkedSingleLoopList(E[] arr) {
if (arr == null || arr.length == 0) {
throw new IllegalArgumentException("arr is null");
}
for (int i = 0; i < arr.length; i++) {
add(arr[i]);
}
}
@Override
public void add(E element) {
add(size, element);
}
@Override
public void add(int index, E element) {
if (index < 0 || index > size) {
throw new IllegalArgumentException("add index out of range");
}
Node n = new Node(element);
if (size == 0) {
head = n;
tail = n;
tail.next = head;
} else if (index == 0) {
n.next = head;
head = n;
tail.next = head;
} else if (index == size) {
n.next = tail.next;
tail.next = n;
tail = n;
} else {
Node p = head;
for (int i = 0; i < index - 1; i++) {
p = p.next;
}
n.next = p.next;
p.next = n;
}
size++;
}
@Override
public void remove(E element) {
int index = indexOf(element);
if (index != -1) {
remove(index);
}
}
@Override
public E remove(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("remove index out of range");
}
E ret = null;
if (size == 1) {
ret = head.data;
head = null;
tail = null;
} else if (index == 0) {
Node n = head;
ret = n.data;
head = n.next;
n.next = null;
tail.next = head;
} else if (index == size - 1) {
Node p = head;
while (p.next != tail) {
p = p.next;
}
ret = tail.data;
p.next = tail.next;
tail.next = null;
tail = p;
} else {
Node p = head;
for (int i = 0; i < index - 1; i++) {
p = p.next;
}
Node n = p.next;
ret = n.data;
p.next = n.next;
n.next = null;
}
size--;
return ret;
}
@Override
public E get(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("get index out of range");
}
if (index == 0) {
return head.data;
} else if (index == size - 1) {
return tail.data;
} else {
Node p = head;
for (int i = 0; i < index; i++) {
p = p.next;
}
return p.data;
}
}
@Override
public E set(int index, E element) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("get index out of range");
}
E ret = null;
if (index == 0) {
ret = head.data;
head.data = element;
} else if (index == size - 1) {
ret = tail.data;
tail.data = element;
} else {
Node p = head;
for (int i = 0; i < index; i++) {
p = p.next;
}
ret = p.data;
p.data = element;
}
return ret;
}
@Override
public int size() {
return size;
}
@Override
public int indexOf(E element) {
Node p = head;
int index = 0;
while (!p.data.equals(element)) {
p = p.next;
index++;
if (p == head) {
return -1;
}
}
return index;
}
@Override
public boolean contains(E element) {
return indexOf(element) != -1;
}
@Override
public boolean isEmpty() {
return size == 0 && head == null && tail == null;
}
@Override
public void clear() {
head = null;
tail = null;
size = 0;
}
@Override
public void sort(Comparator<E> c) {
if (c == null) {
throw new IllegalArgumentException("comparator can not be null");
}
//此处的插入排序O(n^3)
/*
for (int i = 1; i < size; i++) {
E e = get(i);
int j = 0;
for (j = i; j > 0 && c.compare(get(j - 1), e) > 0; j--) {
set(j, get(j - 1));
}
set(j, e);
}
*/
if (size == 0 || size == 1) {
return;
}
Node nodeA = head;
Node nodeB = nodeA.next;
while (true) {
while (true) {
if (c.compare(nodeA.data, nodeB.data) > 0) {
swap(nodeA, nodeB);
}
if (nodeB == tail) {
break;
}
nodeB = nodeB.next;
}
if (nodeA.next == tail) {
break;
}
nodeA = nodeA.next;
nodeB = nodeA.next;
}
}
private void swap(Node nodeA, Node nodeB) {
E temp = nodeA.data;
nodeA.data = nodeB.data;
nodeB.data = temp;
}
@Override
public List<E> subList(int fromIndex, int toIndex) {
//0 <= fromIndex <= toIndex <= size - 1 [fromIndex,toIndex]
if (fromIndex < 0 || toIndex >= size || fromIndex > toIndex) {
throw new IllegalArgumentException("must 0 <= fromIndex <= toIndex <= size - 1");
}
LinkedSingleLoopList<E> list = new LinkedSingleLoopList<>();
/*
for (int i = fromIndex; i <= toIndex; i++) { //O(M)
list.add(get(i)); //O(N) * O(M) = O(NM) ~ O(N^2)
}
*/
Node nodeA = head;
for (int i = 0; i < fromIndex; i++) {
nodeA = nodeA.next;
}
Node nodeB = head;
for (int i = 0; i < toIndex; i++) {
nodeB = nodeB.next;
}
Node p = nodeA;
while (true) {
list.add(p.data);
if (p == nodeB) {
break;
}
p = p.next;
}
return list;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
if (isEmpty()) {
sb.append(']');
} else {
Node p = head;
while (true) {
sb.append(p.data);
if (p == tail) {
sb.append(']');
break;
}
sb.append(',');
sb.append(' ');
p = p.next;
}
}
return sb.toString();
}
@Override
public Iterator<E> iterator() {
return new LinkedSingleLoopListIterator();
}
class LinkedSingleLoopListIterator implements Iterator<E> {
private Node cur = head;
private boolean flag = true;
@Override
public boolean hasNext() {
if (isEmpty()){
return false;
}
return flag;
}
@Override
public E next() {
E ret = cur.data;
cur = cur.next;
if (cur == head){
flag = false;
}
return ret;
}
}
}
(5)约瑟夫环问题
问题描述: 据说著名犹太历史学家Josephus有过一下的故事:
在罗马人占领乔塔帕特后,39个犹太人与Josephus及他的朋友躲在一个洞中,39个犹太人决定宁愿死也不要被敌人抓到,于是决定了一个自杀方式,41个人排成一个圆圈,由第1个人开始报数,每报数到第3个人该人必须自杀,然后再由下一个重新报数,直到所有人都自杀身亡为止。
然而Josephus和他的朋友并不想遵从,Josephus要他的朋友先假装遵从,他将朋友与自己安排在了第16个与第31个位置,于是逃过了这场死亡游戏。
通过单项循环链表内部代码解决:
public void josephRing(){
if (size <= 2){
return;
}
Node p = head;
while(size != 2){
p = p.next;
Node del = p.next;
if (del == head){
head = del.next;
}else if (del == tail){
tail = p;
}
p.next = del.next;
del.next = null;
p = p.next;
size --;
}
}
通过main函数中代码解决:
public static void main(String[] args) {
LinkedSingleLoopList<Integer> list = new LinkedSingleLoopList<>();
for(int i = 1;i<=41 ; i ++){
list.add(i);
}
//list.josephRing();
int index = 0;
while (list.size() != 2){
index = (index + 2) % list.size();
list.remove(index);
}
System.out.println(list);
}
(6)逢七过游戏
问题描述:
- 好友围坐在酒桌前,从任意一人开始轮流报数,数字从1开始。
- 凡是遇到任何7的倍数,如14、21或含7的数字如17、27均喊“过”。
- 遇到反应慢了没有敲zhi打桌面的人则失败。失败的惩罚就是罚酒或者表演节目。
- 接下来,被惩罚过的人重新开始报数,可以从10以下任意一个数字开始。
问题目标: 输入玩家人数、开始数字、最大数字、开始玩家编号等信息,打印出每个玩家需要说出的值
代码实现:
package test;
import p2.array.lists.ArrayList;
import p3.linked.LinkedSingleLoopList;
import java.util.Scanner;
//逢七过
public class SevenGames {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print(">>>请输入玩家数量:");
int playerCount = input.nextInt();
System.out.print(">>>请输入从哪个玩家开始:");
int beginPlayer = input.nextInt();
System.out.print(">>>请输入从哪个数字开始:");
int beginNum = input.nextInt();
System.out.print(">>>请输入最大值:");
int maxNum = input.nextInt();
LinkedSingleLoopList<ArrayList> list = new LinkedSingleLoopList<>();
for (int i = 0; i < playerCount; i++) {
list.add(new ArrayList());
}
int index = beginPlayer - 1;//将玩家编号转换为对应下标
for(int num = beginNum ; num <= maxNum ; num ++){
list.get(index ++ % playerCount).add(getAnswer(num));
}
for (int i = 0 ; i < list.size();i++){
System.out.println("第" + (i+1) + "位玩家" + list.get(i));
}
}
private static String getAnswer(int num) {
if ((num + "").contains("7") || num % 7 == 0){
return "过";
}else{
return num + "";
}
}
}
4.双向循环链表
(1)双向循环链表的定义
双向链表 也叫 双链表 ,是链表的一种,它的每个数据结点中都有两个指针,分别指向直接后继和直接前驱。所以,从双向链表中的任意一个结点开始,都可以很方便地访问它的前驱结点和后继结点。一般我们都构造 双向循环链表 。
(2)代码实现
package p3.linked;
import p1.interfaces.List;
import java.util.Comparator;
import java.util.Iterator;
public class LinkedList<E> implements List<E> {
private class Node{
E data;
Node pre;
Node next;
public Node(){
this(null,null,null);
}
public Node(E data){
this(data,null,null);
}
public Node(E data , Node pre , Node next){
this.data = data;
this.next = next;
this.pre = pre;
}
@Override
public String toString() {
return data.toString();
}
}
private Node head;
private Node tail;
private int size;
public LinkedList(){
head = null;
tail = null;
size = 0;
}
public LinkedList(E[] arr){
if(arr == null){
throw new IllegalArgumentException("array can not be null");
}
for (int i = 0; i < arr.length; i++) {
add(arr[i]);
}
}
@Override
public void add(E element) {
add(size,element);
}
@Override
public void add(int index, E element) {
if(index < 0 || index > size){
throw new IllegalArgumentException("index out of range");
}
Node n = new Node(element);
if(size == 0){
head = n;
tail = n;
tail.next = head;
head.pre = tail;
}else if(index == 0){
n.next = head;
head.pre = n;
head = n;
tail.next = head;
head.pre = tail;
}else if(index == size){
tail.next = n;
n.pre = tail;
tail = n;
tail.next = head;
head.pre = tail;
}else{
Node p , q;
if(index <= size / 2){
p = head;
for (int i = 0 ; i < index - 1; i++){
p = p.next;
}
q = p.next;
}else {
q = tail;
for (int i = size - 1; i > index; i--) {
q = q.pre;
}
p = q.pre;
}
p.next = n;
n.pre = p;
n.next = q;
q.pre = n;
}
size ++;
}
@Override
public void remove(E element) {
int index = indexOf(element);
if(index != -1){
remove(index);
}
}
@Override
public E remove(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("index out of range");
}
E ret = null;
Node n ;
if(size == 1){
head = null;
tail = null;
}else if(index == 0){
ret = head.data;
n = head.next;
head.next = null;
n.pre = head.pre;
head.pre = null;
head = n;
tail.next = head;
}else if(index == size - 1){
ret = tail.data;
n = tail.pre;
tail.pre = null;
n.next = tail.next;
tail.next = null;
tail = n;
head.pre = tail;
}else{
Node p ,q,r;
if(index <= size / 2){
p = head;
for (int i = 0; i < index - 1; i++) {
p = p.next;
}
q = p.next;
r = q.next;
}else{
r = tail;
for (int i = size - 1; i > index + 1; i--) {
r = r.pre;
}
q = r.pre;
p = q.pre;
}
ret = q.data;
p.next = r;
r.pre = p;
q.next = null;
q.pre = null;
}
size --;
return ret;
}
@Override
public E get(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("index out of range");
}
E ret = null;
if(index == 0){
ret = head.data;
}else if(index == size - 1){
ret = tail.data;
}else{
Node p;
if(index <= size / 2){
p = head;
for (int i = 0; i < index ; i++) {
p = p.next;
}
ret = p.data;
}else{
p = tail;
for (int i = size - 1; i > index ; i--) {
p = p.pre;
}
ret = p.data;
}
}
return ret;
}
@Override
public E set(int index, E element) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("index out of range");
}
E ret = null;
if(index == 0){
ret = head.data;
head.data = element;
}else if(index == size - 1){
ret = tail.data;
tail.data = element;
}else{
Node p;
if(index <= size / 2){
p = head;
for (int i = 0; i < index ; i++) {
p = p.next;
}
}else{
p = tail;
for (int i = size - 1; i > index ; i--) {
p = p.pre;
}
}
ret = p.data;
p.data = element;
}
return ret;
}
@Override
public int size() {
return size;
}
@Override
public int indexOf(E element) {
int index = 0;
Node p = head;
while(!p.data.equals(element)){
p = p.next;
index ++;
if (p == head){
return -1;
}
}
return index;
}
@Override
public boolean contains(E element) {
return indexOf(element) != -1;
}
@Override
public boolean isEmpty() {
return size == 0 && head == null && tail == null;
}
@Override
public void clear() {
head = null;
tail = null;
size = 0;
}
@Override
public void sort(Comparator<E> c) {
if (c == null) {
throw new IllegalArgumentException("comparator can not be null");
}
//此处的插入排序
if (size == 0 || size == 1){
return;
}
for (Node nodeA = head.next;nodeA != head;nodeA = nodeA.next){
E e = nodeA.data;
Node nodeB , nodeC;
for (nodeB = nodeA,nodeC = nodeB.pre; nodeC != tail &&c.compare(nodeC.data, e) > 0; nodeB = nodeB.pre , nodeC = nodeC.pre) {
nodeB.data = nodeC.data;
}
nodeB.data = e;
}
}
@Override
public List<E> subList(int fromIndex, int toIndex) {
if (fromIndex < 0 ||toIndex >= size || fromIndex > toIndex){
throw new IllegalArgumentException("index out of range");
}
Node nodeA = head;
for (int i = 0; i < fromIndex; i++) {
nodeA = nodeA.next;
}
Node nodeB = nodeA.next;
for (int i = fromIndex ; i < toIndex; i ++){
nodeB = nodeB.next;
}
Node p = nodeA;
LinkedList<E> list = new LinkedList<>();
while (true){
list.add(p.data);
if(p == nodeB){
break;
}
p = p.next;
}
return list;
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
if (isEmpty()) {
sb.append(']');
} else {
Node p = head;
while (true) {
sb.append(p.data);
if (p == tail) {
sb.append(']');
break;
}
sb.append(',');
sb.append(' ');
p = p.next;
}
}
return sb.toString();
}
@Override
public Iterator<E> iterator() {
return new LinkedListIterator();
}
class LinkedListIterator implements Iterator<E>{
private Node cur = head;
@Override
public boolean hasNext() {
return cur != null;
}
@Override
public E next() {
E ret = cur.data;
cur = cur.next;
return ret;
}
}
}