单链表OJ面试题（重点）

OJ面试题

1. 删除一个链表所有值为key的节点

    public void removeAllKey(int key) {
         Node pre = this.head;
         Node cur =this.head.next;
         while (cur!=null){
             if (cur.data == key){
                 pre.next = cur.next;
                 cur = cur.next;
                 size--;
             }else {
                 pre = cur;
                 cur = cur.next;
             }

         }
         if(this.head.data==key){
             head = head.next;
         }
    }

2. 反转一个单链表

    public Node reverseList(){
       Node reverseHead = null; //反转后新的头节点
        Node cur = this.head;  //cur代表当前需要反转的节点
        Node prev = null;   //cur的前驱信息
        while (cur!= null){
            Node curNext = cur.next;
           if(curNext == null){
               reverseHead = cur;
           }
            cur.next = prev;
            prev = cur;
            cur = curNext;
        }
        return reverseHead;
    }

3. 找到单链表的中间节点

    public Node middleNode(){
        Node cur = this.head;
        int len = getLength()/2;
        for(int i = 0;i<len;i++){
            cur = cur.next;
        }
        return cur;
    }

4. 找到单链表的倒数第k个节点

    public Node findKthToTail(int k){
       if(this.head==null || k<=0 ){
           return null;
       }
        Node fast = this.head;
        Node slow = this.head;

        for(int i = 0;i<k-1;i++){
            if(fast.next!=null){
                fast &