LeetCode链接:876. 链表的中间结点 - 力扣(LeetCode)
思路:先循环整个链表,count初始为1,每循环一次+1,最后除2作为下次循环的截至次数
java代码:
class Solution {
public ListNode middleNode(ListNode head) {
int count = 1;
ListNode curr = head;
while(curr.next != null){
curr = curr.next;
count++;
}
for(int i = 0; i < (count / 2); i++){
head = head.next;
}
return head;
}
}