{"size": 223, "ext": "js", "max_stars_repo_path": "Company/ByteDance/算法题/单链表取出中间元素.js", "max_stars_repo_name": "fireairforce/leetCode-Record", "max_stars_repo_stars_event_min_datetime": "2019-08-29T13:34:15.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-17T09:39:53.000Z", "max_issues_repo_path": "Company/ByteDance/算法题/单链表取出中间元素.js", "max_issues_repo_name": "fireairforce/leetCode-Record", "max_issues_repo_issues_event_min_datetime": "2020-02-18T12:55:36.000Z", "max_issues_repo_issues_event_max_datetime": "2020-03-10T08:41:05.000Z", "max_forks_repo_path": "Company/ByteDance/算法题/单链表取出中间元素.js", "max_forks_repo_name": "fireairforce/leetCode-Record", "max_forks_repo_forks_event_min_datetime": "2019-06-14T13:55:44.000Z", "max_forks_repo_forks_event_max_datetime": "2021-08-20T08:26:50.000Z"}
{"max_stars_count": 74, "max_issues_count": 43, "max_forks_count": 15, "avg_line_length": 20.2727272727, "max_line_length": 41, "alphanum_fraction": 0.4977578475}
let solve = (root) => {
    if(!root){
        return null;
    }
    let slow = root,fast = root,p = root;
    while(fast&&fast.next.next) {
        slow = slow.next;
        fast = fast.next.next;
    }
    return slow;
}