LeetCode算法--876.链表的中间结点(链表)

/**
 * 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) {//head为链表
        ListNode cur=head;//定义ListNode类型的cur为链表的头节点
        int k=0;
        while(cur!=null){
            cur=cur.next;
            k++;
        }
        int n=0;
        ListNode cur2=head;
        while(n<k/2){
            cur2=cur2.next;
            n++;
        }
        return cur2;
    }
}

初次接触链表，有很多理解还不够，等到系统的学习后再来补充，现根据我的理解写在注释上