文章目录
- 准备工作:定义构造器、成员变量等
- 【1】实现void add(int index, E element){}:
- 【2】实现E remove(int index){}:
- 【3】实现E get(int index){}:
- 【4】实现E set(int index, E element){}:
- 【5】实现int indexOf(E element){}:
- 【6】实现void sort(Comparator\ c):
- 【7】实现List\ subList(int fromIndex, int toIndex){}:
- 【8】实现String toString(){}:
- 【9】实现Iterator\ iterator(){}:
- 全部代码:
利用Java语言实现单向链表结构:
首先,创建一个LinkedSinglyList类,让它支持泛型,同时还实现我们定义的List接口
List接口如下:
import java.util.Comparator;
//线性表接口定义
public interface List<E> extends Iterable<E> {
//默认在表尾添加一个元素
public void add(E element);
//在指定角标处添加元素
public void add(int index, E element);
//删除指定元素
public void remove(E element);
//删除指定角标处的元素 并返回原先的值
public E remove(int index);
//获取指定角标处的元素
public E get(int index);
//修改指定角标index处的值为element,并返回原先的值
public E set(int index, E element);
//获取线性表中的元素个数
public int size();
//查看元素第一次出现的角标位置(从左到右)
public int indexOf(E element);
//判断是否包含元素
public boolean contains(E element);
//判断线性表是否为空
public boolean isEmpty();
//清空线性表
public void clear();
//按照比较器的内容进行排序
public void sort(Comparator<E> c);
//获取子线性表 原线性表中[formIndex, toIndex)这个部分
public List<E> subList(int fromIndex, int toIndex);
}
接下来,创建LinkedSinglyList<E>类:
分别实现如下方法:
【1】void add(int index, E element){}
【2】E remove(int index){}
【3】E get(int index){}
【4】E set(int index, E element){}
【5】int indexOf(E element){}
【6】void sort(Comparator<E> c){}
【7】List<E> subList(int fromIndex, int toIndex){}
【8】String toString(){}
【9】Iterator<E> iterator(){}
注意:此处并非是LinkedSinglyList<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 LinkedSinglyList(){
head = null;
tail = null;
size = 0;
}
public LinkedSinglyList(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]);
}
}
【1】实现void add(int index, E 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++;
}
【2】实现E remove(int 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;
}
【3】实现E get(int index){}:
@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;
}
}
【4】实现E set(int index, E element){}:
@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;
}
【5】实现int indexOf(E element){}:
@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;
}
【6】实现void sort(Comparator<E> c):
@Override
public void sort(Comparator<E> c) {
if(c == null){
throw new IllegalArgumentException("comparator can not be null");
}
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 == tail){
break;
}
if(nodeA.next == tail){
break;
}
nodeA = nodeA.next;
nodeB = nodeA.next;
}
}
【7】实现List<E> subList(int fromIndex, int toIndex){}:
@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");
}
LinkedSinglyList<E> list = new LinkedSinglyList<>();
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;
}
【8】实现String toString(){}:
@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();
}
【9】实现Iterator<E> iterator(){}:
此处我为了方便,定义了一个内部类:LinkedSinglyListIterator ,让它实现Iterator接口
@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;
}
}
全部代码:
import p1.接口.List;
import java.util.Comparator;
import java.util.Iterator;
//单向链表
public class LinkedSinglyList<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 LinkedSinglyList(){
head = null;
tail = null;
size = 0;
}
public LinkedSinglyList(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");
}
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 == tail){
break;
}
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");
}
LinkedSinglyList<E> list = new LinkedSinglyList<>();
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;
}
}
}