【leetcode】【单链表】【141】Linked List Cycle
2015-05-11 15:14
381 查看
#include<iostream> using namespace std; struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; class Solution { public: bool hasCycle(ListNode *head) { if (head == NULL || head->next == NULL) //链表空或只有一个节点 return false; ListNode* slow = head; ListNode* fast = head; while (fast&&fast->next){ slow = slow->next; fast = fast->next->next; if (slow == fast) return true; } return false; } ListNode* createList(ListNode* head){ int numOfNode; int value; cout << "please input number of listNode:"; cin >> numOfNode; cin >> value; head = new ListNode(value); ListNode* cur = head; for (int i = 1; i < numOfNode; ++i){ cin >> value; ListNode* temp = new ListNode(value); cur->next = temp; cur = temp; } //cur->next = head; return head; } void printNode(ListNode* head){ ListNode* cur = head; while (cur){ cout << cur->val << " "; cur = cur->next; } cout << endl; } }; int main(){ ListNode* head = NULL; Solution lst; head = lst.createList(head); //lst.printNode(head); cout << boolalpha << lst.hasCycle(head) << endl; system("pause"); return 0; }
参考:http://blog.sina.com.cn/s/blog_725dd1010100tqwp.html
相关文章推荐
- 【LeetCode-面试算法经典-Java实现】【141-Linked List Cycle(单链表中有环)】
- [leetcode 141] Linked List Cycle----判断链表是否为循环链表
- leetcode_c++:链表:Linked List Cycle(141)
- [LeetCode-141] Linked List Cycle(判断链表是否有环)
- 链表-leetcode 141 Linked List Cycle
- LeetCode 141 Linked List Cycle(链表判环)
- Leetcode 141/142 (链表题) Linked List Cycle && Linked List Cycle II
- [C语言][LeetCode][141]Linked List Cycle
- LeetCode 141 Linked List Cycle
- leetcode(141):Linked List Cycle
- [LeetCode]: 141: Linked List Cycle
- 【Leetcode-Easy-141】Linked List Cycle
- [LeetCode] Linked List Cycle 单链表中的环
- 【LeetCode 141】Linked List Cycle(Python)
- leetcode 141-Linked List Cycle
- [LeetCode] 141 - Linked List Cycle
- 019-141-Linked List Cycle 判断链表是否有环
- (LeetCode 141/142)Linked List Cycle
- LeetCode 141 Linked List Cycle
- leetcode--Linked List Cycle--判断链表是否有环