Java [Leetcode 19]remove Nth Node from End of List

Source: Internet
Author: User

Title Description:

Given A linked list, remove the nth node from the end of the list and return its head.

For example,

   1->2->3->4->5  N = 2.   1->2->3->5.

Note:
Given n would always be valid.
Try to do the in one pass.

Problem Solving Ideas:

Set two pointers, two pointers are separated by n-1, and the two pointers move backwards at the same time, when the latter pointer has no successor, the node to which the previous pointer points is the node that needs to be deleted.

The code is as follows:

/** * Definition for singly-linked list. * public class ListNode {*     int val; *     ListNode Next; *     listnode (int x) {val = x;}}} */public class Soluti On {public    ListNode removenthfromend (listnode head, int n) {if (head = = NULL) return null; ListNode ppre = null; ListNode p = head; ListNode q = head;for (int i = 0; i < n-1; i++) q = Q.next;while (Q.next! = null) {Ppre = P;p = P.next;q = Q.next;} if (Ppre = = null) return head.next;ppre.next = P.next;return Head;}}

Java [Leetcode 19]remove Nth Node from End of List

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.