剑指Offer打卡day4——AcWing 17. 从尾到头打印链表

【题目描述】

AcWing 17. 从尾到头打印链表

/**
 * Definition for singly-linked list.
 * class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public int[] printListReversingly(ListNode head) {
        //计算链表的长度从而确定数组的长度
        ListNode  h = head;
        int len = 0;
        while(h != null){
            len ++;
            h = h.next;
        }
        //按数组从尾到头的顺序填入数组
        int a[] = new int[len];
        while(head != null){
            a[--len] = head.val;
            head = head.next;
            
        }
        return a;
        
    }
}

19. 删除链表的倒数第 N 个结点

/**
 * 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 removeNthFromEnd(ListNode head, int n) {
        // 创建虚节点
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        // first、second指针都指向虚节点
        ListNode first = dummy;
        ListNode second = dummy;
        // first 先跳 n个节点
        for(int i = 0; i < n; i ++){
            first = first.next;
        }
        // 剩下len -n 个节点即为正向数过去的步数
        while(first.next != null){
            first = first.next;
            second = second.next;
        }
        second.next = second.next.next;
        return head;
    }
}