难度:简单。完成
网址:https://leetcode-cn.com/problems/middle-of-the-linked-list/
- 我的解法:
类似于快慢指针,middleNode慢指针,currentNode快指针。但是和大佬的想法还有差距
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode middleNode(ListNode head) {
ListNode middleNode = head;
ListNode currentNode = head;
int i = 1;
while(currentNode.next != null){
i++;
if(i%2 == 0){
middleNode = middleNode.next;
}
currentNode = currentNode.next;
}
return middleNode;
}
}
- 大佬解法:
class Solution {
public ListNode middleNode(ListNode head) {
ListNode slow = head, fast = head;
while (fast != null && fast.next != null) {
slow = slow.next;
fast = fast.next.next;
}
return slow;
}
}
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/middle-of-the-linked-list/solution/lian-biao-de-zhong-jian-jie-dian-by-leetcode-solut/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
相比来说我的解法内存消耗多了一个int i,而且官方解法的快慢指针更加巧妙确实很棒。
但是我记得一句话,代码是写给人看的,顺便给机器执行。