链表倒数第k个/找出和删除

找出链表倒数第k个节点

        if(pHead==null) return null;
        ListNode slow = pHead;
        ListNode fast = pHead;
        while(fast!=null&&k>0){
            fast = fast.next;
            k--;
        }
        if(k!=0) return null;
        while(fast!=null){
            fast = fast.next;
            slow = slow.next;
        }
        return slow;

删除倒数第k个节点

 ListNode fast = head;
        ListNode slow = head;
        while(fast!=null&&n>0){
            fast=fast.next;
            n--;
        }
        //如果n的值等于链表长度,返回head.next;
        if(fast == null)
            return head.next;
        while(fast.next!=null){
            slow =slow.next;
            fast = fast.next;
        }
        slow.next = slow.next.next;
        return head;