876. middle of the linked list

Given a non-empty, singly linked list with head node head, return a middle node of linked list.

If there are two middle nodes, return the second middle node.

Example 1:

Input: [1,2,3,4,5]
Output: Node 3 from this list (Serialization: [3,4,5])
The returned node has value 3.  (The judge's serialization of this node is [3,4,5]).
Note that we returned a ListNode object ans, such that:
ans.val = 3, ans.next.val = 4, ans.next.next.val = 5, and ans.next.next.next = NULL.

Example 2:

1
2
3

Input: [1,2,3,4,5,6]
Output: Node 4 from this list (Serialization: [4,5,6])
Since the list has two middle nodes with values 3 and 4, we return the second one.


 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class  {
    public ListNode middleNode(ListNode head) {
        int count = 0;
       ListNode curr = head;
        while (curr != null) {
         count++;
         curr = curr.next;
        }
        int middle = count / 2;
     count = 0;
       curr = head;
     while (count < middle) {
         curr = curr.next;
            count++;
     }
        return curr;
    }
}

876. middle of the linked list

近期文章

近期评论

标签

热门

文章归档

分类目录

功能