Leetcode刷题顺序—链表3

题目

🔗707. 设计链表

看懂题目

有一个地方需要注意就是这里的index指的就是下标，不是第几个。

解题思路

1. 这个没啥思路，就是对于链表的理解。这个必须背下来

思路转换为代码

public class ListNode{
    int val;
    ListNode next;
    ListNode(){}
    ListNode(int x){val = x;}
}
class MyLinkedList {
    int length;
    ListNode head;
    /** Initialize your data structure here. */
    public MyLinkedList() {
        int length = 0;
        head = new ListNode(0);
    }
    
    /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
    public int get(int index) {
        if(index < 0 || index > length - 1 || length == 0){
            return -1;
        }else{
            ListNode temp = head;
            for(int i = 0; i <= index; i++){
                temp = temp.next;
            }
            return temp.val;
        }
    }
    
    /** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
    public void addAtHead(int val) {
        ListNode newNode = new ListNode(val);
        newNode.next = head.next;
        head.next = newNode;
        length++;
    }
    
    /** Append a node of value val to the last element of the linked list. */
    public void addAtTail(int val) {
        ListNode newNode = new ListNode();
        newNode.val = val;
        ListNode temp = head;
        while(temp.next != null){
            temp = temp.next;
        }
        temp.next = newNode;
        length++;
    }
    
    /** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
    public void addAtIndex(int index, int val) {
        if(index > length){
            return ;
        }
        if(index <= 0){
            addAtHead(val);
            return ;
        }
        ListNode newNode = new ListNode(val);
        ListNode temp = head;
        for(int i = 0; i <= index - 1; i++){
            temp = temp.next;
        }
        newNode.next = temp.next;
        temp.next = newNode;
        length++;
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    public void deleteAtIndex(int index) {
        if(index < 0 || index > length - 1 || length == 0){
            return ;
        }

        ListNode pre = head;
        for(int i = 0; i <= index - 1; i++){
            pre = pre.next;
        }
        ListNode current = pre.next;
        pre.next = current.next;
        length--;
    }
}

/**
 * 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);
 */

总结

必须对于链表的五种操作非常熟练，这是基本功。
我非常的不熟练，不是对于理解上的不熟练。

而是对于每个操作的上下界很不熟悉。不知道如何处理。
这个得加强！！！（想想有没有什么方法？）