Node* findMid(Node* &head)
{
    if(head == NULL||head->next == NULL)
        return head;
    
    Node* p = head;
    Node* q = head;
    while(q->next->next&&(q = q->next))
    {
        p = p-> next;
        q = q->next;
    }
    return p;
}

 

 posted on 2014-06-09 11:57  Clivia_zhou  阅读(229)  评论(0编辑  收藏  举报