DAY03——链表

1.链表基础

Java中定义链表结构

 //Definition for singly-linked list.
 public class ListNode {
      int val;
      ListNode next;
      ListNode() {}
      ListNode(int val) { this.val = val; }
      ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  }

2.题目

 

class Solution {
    public ListNode removeElements(ListNode head, int val) {
        //添加虚拟头节点,值赋为-1，并指向head
        ListNode newHead = new ListNode(-1,head);
        ListNode cur = head;
        ListNode pre = newHead; //需要更新
        while(cur != null){
            if(cur.val == val){
                pre.next = cur.next;
            }else{
                pre = cur;
            }
            cur = cur.next;
        }

        return newHead.next;
    }
}

3.题目

代码随想录 (programmercarl.com)

 

class ListNode {
    int val;
    ListNode next;
    ListNode(){}
    ListNode(int val) {
        this.val=val;
    }
}

class MyLinkedList {
    int size;  //定义链表长度
    ListNode head;  //头节点

    public MyLinkedList() {  //初始化对象
        size = 0;
        head = new ListNode(0);
    }
    
    public int get(int index) {
        //获取链表中下标为 index 的节点的值。如果下标无效，则返回 -1
        if (index < 0 || index >= size) {
            return -1;
        }
        ListNode currentNode = head;
        for (int i = 0; i <= index; i++) {
            currentNode = currentNode.next;
        }
        return currentNode.val;
    }
    
    public void addAtHead(int val) {
        addAtIndex(0, val);
    }
    
    public void addAtTail(int val) {
        addAtIndex(size, val);
    }

    public void addAtIndex(int index, int val) {
        if (index > size) {
            return;
        }
        if (index < 0) {
            index = 0;
        }
        size++;
        //找到要插入节点的前驱
        ListNode pred = head;
        for (int i = 0; i < index; i++) {
            pred = pred.next;
        }
        ListNode toAdd = new ListNode(val);
        toAdd.next = pred.next;
        pred.next = toAdd;
    }

    public void deleteAtIndex(int index) {
        if (index < 0 || index >= size) {  //index非法  直接return
            return;
        }
        size--;
        if (index == 0) { //删除的是头节点
            head = head.next;
	    return;
        }
        ListNode pred = head;
        for (int i = 0; i < index ; i++) {
            pred = pred.next;
        }
        pred.next = pred.next.next;
    }
}

/**
 * Your MyLinkedList object will be instantiated and called as such:
 * MyLinkedList obj = new MyLinkedList();
 * int param_1 = obj.get(index);
 * obj.addAtHead(val);
 * obj.addAtTail(val);
 * obj.addAtIndex(index,val);
 * obj.deleteAtIndex(index);
 */

4.题目

代码随想录 (programmercarl.com)

 遍历链表，每次遍历到一个节点时，进行连接方向的更改：

1. 当前节点的next更改为pre

2.当前节点成为pre

3.下一个节点成为cur，作为下一个需要操作的节点

class Solution {
    public ListNode reverseList(ListNode head) {
        ListNode prev = null;  
        ListNode cur = head;
        while (cur != null) {
            ListNode next = cur.next;
            cur.next = prev;
            prev = cur;
            cur = next;
        }
        return prev;
    }
}