Leetcode
2020.05.04 08:55

876. Middle of the Linked List

조회 수 319 추천 수 0 댓글 0
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄
?

단축키

Prev이전 문서

Next다음 문서

크게 작게 위로 아래로 댓글로 가기 인쇄

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:

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.

 

Note:

  • The number of nodes in the given list will be between 1 and 100.


/**
 * 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 middleNode(ListNode head) {
        ListNode node = head;
        int count = 0;
        
        while(node != null){
            count++;
            node = node.next;
        }
        
        node = head;
        for(int i=0; i<count/2; i++){
            node = node.next;
        }
        
        return node;
    }
}


/**
 * 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 middleNode(ListNode head) {
        List<ListNode> list = new ArrayList<>();
        ListNode node = head;
        int count = 0;
        
        while(node != null){
            count++;
            list.add(node);
            node = node.next;
        }
        
        return list.get(count/2);
    }
}

[문제] https://leetcode.com/problems/middle-of-the-linked-list/



?

List of Articles
번호 분류 제목 글쓴이 날짜 조회 수
77 Leetcode 720. Longest Word in Dictionary hooni 2020.05.07 413
76 Leetcode 225. Implement Stack using Queues hooni 2020.05.05 359
75 Leetcode 56. Merge Intervals hooni 2020.05.05 326
74 Leetcode 844. Backspace String Compare hooni 2020.05.05 332
73 Leetcode 222. Count Complete Tree Nodes hooni 2020.05.05 344
72 Leetcode 697. Degree of an Array hooni 2020.05.05 371
71 Leetcode 605. Can Place Flowers hooni 2020.05.05 324
70 Leetcode 724. Find Pivot Index hooni 2020.05.05 336
69 Leetcode 448. Find All Numbers Disappeared in an Array hooni 2020.05.05 302
68 Leetcode 628. Maximum Product of Three Numbers hooni 2020.05.05 315
67 Leetcode 532. K-diff Pairs in an Array hooni 2020.05.04 345
66 Leetcode 897. Increasing Order Search Tree hooni 2020.05.04 325
65 Leetcode 872. Leaf-Similar Trees file hooni 2020.05.04 319
» Leetcode 876. Middle of the Linked List hooni 2020.05.04 319
63 Leetcode 203. Remove Linked List Elements hooni 2020.05.04 313
62 Leetcode 997. Find the Town Judge hooni 2020.05.02 360
61 Leetcode 270. Closest Binary Search Tree Value hooni 2020.05.01 292
60 Leetcode 687. Longest Univalue Path hooni 2020.05.01 338
59 Leetcode 783. Minimum Distance Between BST Nodes hooni 2020.05.01 363
58 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree file hooni 2020.05.01 346
Board Pagination Prev 1 2 3 4 Next
/ 4