Nothing but admire: http://fisherlei.blogspot.com/2013/11/leetcode-linked-list-cycle-ii-solution.html classSolution {public: ListNode*detectCycle(ListNode *head) { ListNode dum(0); dum.next =head; ListNode*sp = &dum; ListNode*fp = &dum;while(sp &&fp) { sp= sp->next; fp= fp->nex...