[Leetcode]Linked List Cycle
来源:互联网 发布:fifa17金币价格淘宝 编辑:程序博客网 时间:2024/06/15 10:06
//判断链表是否有环
class Solution {
public:bool hasCycle(ListNode *head) {
ListNode *first=head;
ListNode *second=head;
while(second!=NULL&&second->next!=NULL)
{
first=first->next;
second=second->next->next;
if(first==second)
return true;
}
return false;
}
};
0 0
- leetcode Linked List Cycle & Linked List Cycle ||
- 【LeetCode】Linked List Cycle
- Leetcode: Linked List Cycle
- Leetcode Linked List Cycle
- Leetcode: Linked List Cycle
- LeetCode:Linked List Cycle
- [LeetCode]Linked List Cycle
- LeetCode | Linked List Cycle
- Leetcode: Linked List Cycle
- LeetCode: Linked List Cycle
- LeetCode - Linked List Cycle
- [LeetCode] - Linked List Cycle
- LeetCode - Linked List Cycle
- [LeetCode]Linked List Cycle
- 【LeetCode】Linked List Cycle
- Linked List Cycle - LeetCode
- 【LeetCode】Linked List Cycle
- Linked List Cycle -- LeetCode
- C#——调用exe程序并运行
- [Leetcode]Linked List Cycle II
- Binary Tree Level Order Traversal II
- iptables
- c#函数覆盖、隐藏、重载个人总结
- [Leetcode]Linked List Cycle
- 数据结构之排序
- 【BZOJ 1086】 [SCOI2005]王室联邦
- Linux 如何调整虚拟内存大小
- uva213信息解码
- Linux网络编程IPv4和IPv6的inet_addr、inet_aton、inet_pton等函数小结
- YNDd3GUCCI包包 0xzX 3fu
- Qt Quick里的图形效果——渐变(Gradient)
- Leetcode: Populating Next Right Pointers in Each Node