数据结构 - 判断单链表是否有环（C++）

template<class T>bool SingleLinkedList<T>::hasLoop(void){Node<T> *slow = head, *fast = head;while (fast && fast->next){slow = slow->next;fast = fast->next->next;if (slow == fast){break;}}if (fast == NULL || fast->next == NULL){return false;}else{return true;}}