第二章 链表part01

构造函数复习

java版代码：

public class ListNode{
    int val;
    ListNode next;

    public ListNode(){

    }
    public ListNode(int val){
    this.val = val;
    }

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

}

203.移除链表元素

自己的繁琐解法：

/**
 * 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; }
 * }
 */
class Solution {
    public ListNode removeElements(ListNode head, int val) {
       while(head != null && head.val==val){
           head = head.next;
       }
       if(head == null){
           return null;
       }
        ListNode temphead;
        ListNode temp;
        temphead = head;
       
        while(temphead.next != null){
            temp = temphead.next;
            if(temp.val == val){
                temp = temp.next;
                temphead.next = temp;
            }else{
                temphead = temphead.next;
            }
            
        
         }
       return head;

    }
}

最开始错误点：

1、没考虑链表头就是要删除元素的情况，没法处理链表头，

处理方法：如果链表头head就是需要删除元素的话，head直接指到head.next位置 就忽略这个链表头了

while(head != null && head.val == val){
    head = head.next;
}

2、没有写temphead 往后移动的函数

处理方法：

while(temphead != null){
    temp = temphead.next;
    if(temp.val == val){
        temphead.next = temp.next;
    }else{
        temphead= temphead.next;
        }
}

此种方法 需要两个指针遍历，过于繁琐，运算速度较慢。

代码随想录解法：

添加虚拟节点：

/**
 * 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; }
 * }
 */
class Solution {
    public ListNode removeElements(ListNode head, int val) {
         if (head == null) {
        return head;
    }
    // 因为删除可能涉及到头节点，所以设置dummy节点，统一操作
    ListNode dummy = new ListNode(-1, head);
    ListNode pre = dummy;
    ListNode cur = head;
    while (cur != null) {
        if (cur.val == val) {
            pre.next = cur.next;
        } else {
            pre = cur;
        }
        cur = cur.next;
    }
    return dummy.next;

    }
}

707.设计链表

单链表方法

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;
        //包含一个虚拟头节点，所以查找第 index+1 个节点
        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;
        ListNode toAdd = new ListNode(val);
        for(int i=0;i<index;i++){
            pred=pred.next;
        }
        toAdd.next = pred.next;
        pred.next = toAdd;

    }
    
    public void deleteAtIndex(int index) {
       if (index < 0 || index >= size) {
            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);
 */

边界条件判断部分问题：

局部变量问题

在代码class mylinkedlist 类中，我们定义了 int val 和 listNode head 那么此时 head就是全局变量，在同名方法mylinkedlist中 我犯了再次定义head的错误，我当时写的是

listNode head = new listNode(0);

这是不对的，这样新建的head变量就变成了 与全局变量head不一样的局部变量，导致后面所有函数head 调用的都是0的，
206.反转链表

双指针解法：

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

    }
}

递归解法：

class Solution {
    public ListNode reverse(ListNode cur, ListNode pre){
        if(cur == null)return pre;
        ListNode temp = cur.next;
        cur.next = pre;
        return reverse(temp,cur);
        

    } 
    public ListNode reverseList(ListNode head) {
        return reverse(head,null);

    }
}