找链表的中间节点

 链接:https://leetcode-cn.com/problems/middle-of-the-linked-list/submissions/

//1.快慢指针算法(v 和 2v，当2v的指针走到终点，v指针刚好走到中间)

struct ListNode* middleNode(struct ListNode* head)

{

   struct ListNode* low,*fast;

   low =head;

   fast=head;

   while(fast!=NULL&&fast->next!=NULL)

   {

       low=low->next;