寻找中间链表--Leetcode

最新推荐文章于 2024-06-19 16:27:15 发布

NI_oy

最新推荐文章于 2024-06-19 16:27:15 发布

阅读量130

点赞数

分类专栏： Leetcode 文章标签：链表

本文链接：https://blog.csdn.net/Space_analyse/article/details/108875294

版权

链表中间节点快慢指针算法数据结构

关键词由CSDN通过智能技术生成

Leetcode 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

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:

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.

题意：给一个链表找中间节点；如果有两个中间节点，取后一个；

思路一：
遍历一边得到n，然后再遍历n/2次，此时指向中间节点；
时间复杂度：O(n + n/2) = O(n)
空间复杂度：O(1)

思路二：
利用数组的思想，空间换时间；
将一个链表赋值进去一个数组并计数，然后返回下标(n+1)//2；

思路三：
很巧妙的思想，快慢指针法；
让两个指针slow 和 fast ，slow走一步，fast走两步；
（根据实际情况限定 : 如果fast最后两步没走完，slow就不需要走动）

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* middleNode(ListNode* head) {
        if(!head) return head;
        ListNode* slow = head,*fast = head;
        while(fast!=nullptr){
            fast = fast->next;
            if(fast){
                fast = fast->next;
                slow = slow->next;
            }
        }
        return slow;
    }
};