单链表
结点:由数据域和指针域组成
链表长什么样子?(大概这样)
后继与前驱: 例如上图a1是a2 的前驱,a3是a2的后继。
头结点和头(尾)指针:头结点是指链表的第一个结点(例如上图中的a1)、
头指针(head):是仅仅是一个引用变量,储存头结点地址的指针而已。
尾指针(tail):是链表中最后一个结点的指针。
链表的操作
添加元素
1.当链表为空时,将头指针和尾指针都指向新增结点。如图
2.链表中有元素,在表头添加元素,先将新增结点的指针域指向原链表的首结点,然后将头指针指向新增结点。此时的新增结点就是新的头结点。如图
3.在链表的表尾添加,先将尾结点的指针域(不是尾指针)指向新增结点,然后再将尾指针指向新增结点。
3.在链表中添加,如图假如我们想在2这个结点后添加一个结点,则先将结点2 的指针域为空,然后在让新增的这个结点的指针域指向3结点,然后2的指针域指向新增的这个结点。
将2结点的指针域为null
将新增结点的指针域指向结点3
将结点2 的指针域指向新增结点
删除操作
1.在表头删除结点,先将头指针指向下一个结点(此时下一个结点即将成为首结点),然后再将原首结点的指针域为空。
将原首结点的指针域为空
2.在表尾删除结点,先定义一个p指针,让p指向最后一个结点(假设将最后一个几点设为n)的前一个结点(n-1),然后将n-1结点的指针为空,再将尾指针指向n-1结点。
将尾指针指向n-1结点
3.在链表中删除,假定,我们要删除第四个结点,还是定义一个p指针,将p指向删除结点的前一个结点(也就是结点3),先将结点3 的指针域指向结点5,然后再将删除的结点的指针域为null。
将结点3的指针域指向结点5
删除的指针域为null
链表的选择排序
排序问题(从小到大):先新定义两个nodeA,nodeB指针,nodeA指向首结点,nodeB指向第二个结点,,然后比较这两个指针所指的结点的数据域的大小,若nodeB比nodeA小,则交换数据域
。
第二圈比较,重复操作
获得子链表
获得2到5的子链表
先创建两个指针,分别为nodeA,nodeB,分别指向结点2和结点5,然后在定义一个指针p,将指针p=指针nodeA,在创建一个链表,用while循环,将各个几点添加到新链表中
代码
public class LinkedStringlyList<E> implements LinearTable<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 LinkedStringlyList() {
head = null;
tail = null;
size = 0;
}
public LinkedStringlyList(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");
}
LinkedStringlyList<E> list = new LinkedStringlyList<E>();
/*
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<E>) 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;
}}
}
双向循环链表
双向链表也叫双链表,是链表的一种,它的每个数据结点中都有两个指针,分别指向直接后继和直接前驱。
头尾添加元素
当表中无元素,直接添加
头部添加:
尾部
中间
删除元素
头部删:
尾部:
中间
代码
//双向循环链表
public class LinkedList<E> implements LinearTable<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.pre = pre;
this.next = next;
}
@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("arr can not be null");
}
for (E e : arr) {
add(e);
}
}
@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);
//如果链表为空,n为新增结点,
if (size == 0) {
head = n; //头指针指向新结点
tail = n; //尾指针指向新结点
tail.next = head; //新结点的前驱指向自己
head.pre = tail; //新结点的后继指向自己
}//在表头添加,先解决新结点的前驱,然后解决新结点和原首结点的关系,在解决新结点的后继问题
else if (index == 0) {
n.pre = head.pre; //将新结点的前驱等于原首结点的前驱
n.next = head; //新结点的后继指向原首结点
head.pre = n; //因为此时的head还是指向原首结点,因为在原首结点前加个新结点,所以原首结点的前驱是新结点,所以原结点指向前驱
head = n; // head指向新结点
tail.next = head; //因为是循环链表,那么原来的tail现在应指向新结点
}//在表尾添加,先解决新尾结点的后继指向原结点,再解决新尾结点和旧结点的关系,再解决首结点的前驱问题
else if (index == size) {
n.next = tail.next;//在末尾添加,将新结点的后继指向首结点,因为原来的tail.next指向的就是首结点
tail.next = n; //然后将原尾结点的后继指向新结点
n.pre = tail; //新结点的前驱指向原尾结点
tail = n; //将tail指向新尾结点
head.pre = tail; //既然是循环链表那么首结点的前驱指向新结点
}//在表中添加
else {
Node p, q;//定义两个指针p,q.
if (index <= size / 2) { //为了方便寻找插入点,如果插入点小于等于有效结点的2/1,则在前半部分
p = head; //p从首结点开始
for (int i = 0; i < index - 1; i++) { //这里为什么是index-1,是因为是要在原来的位置2结点前插入一个结点
p = p.next;//每遍历一次,p指向下一次后继
}//此时找到p的位置
q = p.next; //找到q的位置
p.next = n; //p的后继指向新结点n
n.pre = p; //n的前驱指向p
q.pre = n; //q的前驱指向n
n.next = q; //n的后继指向q
} else //当添加的结点属于后部分
{
p = tail; //将p指向尾结点
for (int i = size - 1; i > index; i--) {//为何size-1:因为p已经是尾结点,所以从-1开始遍历,为什么不index-1因为添加是在找到的位置前面增加不需要-1
p = p.pre;//每遍历一次指一次前驱,直到找到位置
}//p找到了插入的位置
q = p.pre;//找到q的位置
q.next = n;//q的后继指向n
n.pre = q;//n的前驱指向q
n.next = p;//n的后继指向p
p.pre = n;//p的前驱指向n
}
}
size++;
}
@Override
public void remove(E element) {
int index = indexOf(element);//找到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; //定义了ret为null
Node node; //定义了一个结点
//当表中只有一个结点
if (size == 1) {
ret = head.data; //将头结点的数据域为null
head = null;//头指针为空
tail = null;//尾指针为空
}//在表头删除
else if (index == 0) {
ret = head.data; //将首结点的数据域给ret
node = head.next;//将头指针的下一个等于node
head.next = null;//将原来的头指针的下一个为空
node.pre = head.pre;//将node的前驱指向头指针的前驱
head.pre = null;//将删除结点的指向前驱指针为null
head = node;//头指针指向node
tail.next = head;//尾指针指向node
}//在表尾删除
else if (index == size - 1) {
ret = tail.data;//将首结点的数据域给ret
node = tail.pre;//将尾指针的前驱为node(找到node)
tail.pre = null;//尾结点的指向前驱的指针为空
node.next = tail.next;//原尾结点的后继指针给node后继指针
tail.next = null;//原尾结点的的后继指针为空
tail = node;//尾指针指向node
head.pre = tail;//头结点的前驱指针指向尾结点node
}//在表中删除
else {
Node p, q, r; //q为删除的结点,p为删除结点的前驱,r为删除结点的后继
if (index <= size / 2) {// 若果在前半部分
p = head;//p指向头结点
for (int i = 0; i < index - 1; i++) {
p = p.next;
}//找到p,此时的p是删除的结点的前驱
q = p.next;//确定删除结点q的位置
r = q.next;//找到删除结点q的后继r的位置
ret = q.data;//将删除结点q的数据域给ret
p.next = r;//将p的后继指向r
r.pre = p;//将r的前驱指向p
q.next = null;//将q的后继为null
q.pre = null;//将q的前驱为null
} else { //若果在后半部分
p = tail;//将p指向尾结点
for (int i = size - 1; i > index + 1; i--) {
p = p.pre;
}
q = p.pre;
r = q.pre;
ret = q.data;
r.next = p;
p.pre = r;
q.next = null;
q.pre = 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("set 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");
}
//插入排序来做
if (size == 0 || size == 1) {
return;
}
for (Node nodeA = head.next; nodeA != head; nodeA = nodeA.next) {
E e = nodeA.data;
Node nodeB;
Node 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("0 <= fromIndex <= toIndex < size");
}
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;
LinkedList<E> list = new LinkedList<>();
while (true) {
list.add(p.data);
if (p == nodeB) {
break;
}
p = p.next;
}
return (List<E>) 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;
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;
}
}
}