首页 > 其他 > 详细

Nth to Last Node in List

时间:2016-07-03 06:59:30      阅读:180      评论:0      收藏:0      [点我收藏+]

Find the nth to last element of a singly linked list. 

The minimum number of nodes in list is n.

Example

Given a List  3->2->1->5->null and n = 2, return node  whose value is 1.

分析:

要找到nth to last element,我们需要两个指针,第一个指针先走n步,然后两个指针同时走,知道第一个指针为null.

 1 public class Solution {
 2     /**
 3      * @param head: The first node of linked list.
 4      * @param n: An integer.
 5      * @return: Nth to last node of a singly linked list. 
 6      */
 7     ListNode nthToLast(ListNode head, int n) {
 8         if (head == null || n <= 0) return null;
 9         
10         ListNode first = head;
11         ListNode last = head;
12 
13         for (int count = 1; count <= n; count++;) {
14             first = first.next;
15         }
16         
17         while(first != null) {
18             first = first.next;
19             last = last.next;
20         }
21         return last;
22     }
23 }

转载请注明出处:cnblogs.com/beiyeqingteng/

Nth to Last Node in List

原文:http://www.cnblogs.com/beiyeqingteng/p/5636476.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!