leetcode--009 Linked List Cycle I
aaarticlea/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZgAAACACAIAAAC5q+hAAAAJ+UlEQVR4nO2dwbXrKBJAOyelRShEQwqTgXa9mAh0zqTgWciWCqgC9CzZLvve1bcfAlQqrgG7m39uAADO+efdHQAAeBZEBgDuGRXZ/wAAPhVmZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO55hcj+++AFbQHAD4LIAMA9iAwA3IPIAMA9iAwA3IPIAMA9iAwA3IPIAMA9iAwA3IPIfotlWVzU+WK+4BZeyQeGy5/I5jgJQlrkX+TLF7O13u3GHKcpzn9tRLl0sOklhYMB6vf0eJ1DrT5fpajkkTF5pVsB6xaeeExv41Do/lb4iid+Ar5ENscpT67qjfcxnhbXiayNF5GdTO8mflZkf+NDn7gnkamZJeJ6f4pFMfFySaGeyc1xCmne/mI8I3Gpoc56WmTVXPWo1b2bmIOGlEZnZFVd4o3O6LSaq7tX16newpLCWtU0TSH9m8K0vZymOO8N3ivpBrARqzImYv5e3PZaoBGWOU5TTFrrRjJ0+zSQRaKMnFCKoksK95dVyVxkoyEaGwLdcL0ZRyIbWbKFtBRPfnuRfZLk+svGkNZIVeOQTayaH7UtKewVWd2T72cVtpqW/d3/PfJZajU30r1WmXJ8rbXqLXQDaDWkxsSaWQ0tLVuPby8U55sV87LCgSyq0jW7bvOYmtj6TfVCNDgEWFqeIrL9k8giezDisVR5llWX/2FkPTG6UWXVvP4rTxire/b0stW0XmwgBa3mzOhZ480ocyv0rY7+XgDNhtSYPCWyfmKYveqhlu8a0Ejb8qaOhWjkThHZRSLLZunlwqrOrnxSLy8bF5lYpjwtsmIOb3WvzBrd5nXTe31FyNopaDVnR2+/ol1m70bWhpxlj4rMbkiNyUUiq5NBjXlNK4u6XTE+HMqbOhgiRDbGtUtLZUmyPYyRZdXgUxSpcM6MLOuv1b2/iizv93AKtkSmX5mLzC5zssj6I+k6kXWSIY95WWE7i8xbu4cw3x9ri+xAiBDZGJdu9usiW8smMYLMqdbAUyz8cJbIWusyo63RpiVbKycuLevKO2VOFNnYIu4ykQ0lg1bnyIXtGPbz2VpaqiCyg5z884tyyjDVS8v9L/kAykfN8FOUb2YtFoWOikx2w+qe3FJaP9IP7pGNzJl2rOZa3ZPTSqvMmSIzG1JjcoHI1GTQY27U18oicZP1VooVjv2RtdNJjQAiG+PcH8QW6/98/iAinG0q15fW40d5JasWDbanbUdEluWY2j35/oGfX4gO7xfIwaBO3prN6d3LB5ha5nSRNWJVx6QrstoRSnvlp4+WDGrMyxo7WWRvtdX5rJSU8RwP0SGRDWbRq/EnMjiHJcXPSEEYov+t/U+DyH4UPOaLJYUPmft8JogM4LNZ13JorAkiAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3OBLZksJUE+fGJXOcQlrkPwDgC3EmsoM2QmQAP8HXiEzM1/ZCqsjqkksKj5ndksJjlqe1N0c5B9xfzXEKad4qzopgUICr+Q6RCf2sermXq0Wml9xNNscQgj2La4hs91fWBgBcjzORFdQzqtvtJgRTicwqKf4eY5ziXBfNay5e5e+XLwHgWpyJTJ+RlXOnrWQlslbJVWghzSmEtDzeqVqyl5ZLXS0AvAJEtk3FQlqWFOK8Kmx9Q2kJkQF8HF8hsueXluuiMq3yWlIIKUWtLZaWAJ/IV4js6c3+x4utdAjKBllx+bpnp2z2Z9UCwPV8h8huz/38YissfnhhzqhWZ03T/fcWYkYWY10tP78AeAGORPbJsJYEeCeI7BQQGcA7QWSngMgA3gkiAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8iAwD3IDIAcA8i+zaW5e9HBDxz7SvrvBqPff5x3IlsO/ujOjzEK8+fT5KdEXWwLvXas/6Ht6ec7/ni81s8nkkqB8WP/o+KXYmsPN1ojt/w4E4cqM8Mwo8V2Ytx1+dsVDQPAPtmHIlMyzB5hKQ45m3Kzq5cz20z53DFqBVn+FpHzKln9FZ9VVpsnVlnn/FrnV8ny67HpKufyuUN7Ufe3Zutr53jNMWkBm08JlZ/WjHUas/P9NMfpTijL1kSVuoWKbWG5j95n+9HNe/X6DnWa6bseZFtWoXb+9kTN+rOOlKeQf0j+BFZ55Mye55iqjZwdG526ZYHjUN/eyKTbxqnZSqnCFd3sHUjO5JTV3Frabmn9hxDCPlJn+bSUgva0ZhYz8wor8dNikztVdlBzTBWGB/NLCmIKrLPRsPX+nLAvIW9sAhiK2mrpz+SCVVsfwY/Ijv0gPIc6k2giinBlkKypDraBkS20apwH6himCqtGZ+3vT2yx9+XFGKMj4FbtG4vLbNhdSgmT4hMuTv7KtGGvrZqhHGOU5znmC3OVHe0b6L1ZmO2rZYaqtnKhJ/U2NeJrN71HFoJKkO13Lnacnqkwn0JkJU0KywnNll/Kqqh1d3sv4/TOYY0r1OPbeQeEdnhmBwUmRq3nshMuwqaYSzUV4pMl4W5uGzfQt2EUqEatYFM+F2L3TyJzFg2Pb4on6N8tMdmZFvG5h/UfxeZ+OPWqQGRPWrrm6Bqpy2ydeG0pLBWHud9JfVRItPidpbImjOrYm/BEJmVY2al1S0UTegVmiJrZoK7LynOxY/I1Ce1fZoWqXJUZGvKJpG3zywt1W73l5aPN2U3RuehnZ9fLCnEtMrrvoEtnPUxS8uyy4XoT1xaZs2sjteWk/kNmzlmYYh+e2lVeGDRmv39hz3mSWTV3qucS8vHfJ+FN7Nfr7tcYmQ+UTa814uaObePi95mf6MbmejUbys6IltD9YhICJkph0V2OCaNGaJWXo9bT2T21xRli3UYla2Epsj0HCvirN7C3qs9bgNJK3owkgm/iyuR3W75hkL1ebZvNByfQCkf5dq33VlT63fqxqabso+iVtidUcjtETV39xrMb+0sG+nXNoJ2LCbt/tTltbh1RZbXlqyZiRJGWUc275zsZauSY/qNTUXdMeaNNytUt9qamcCM7HJ8/CdK6sYuuOMTB/TQBgE8AyK7I3ZJwBXZIuszt7wR2eUgsseE/fPSHwbprr3fDSK7HEQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO5BZADgHkQGAO75P/kC1bbp/DRQAAAAAElFTkSuQmCC" alt="" />
public boolean hasCycle(ListNode head) {
ListNode s=head;
ListNode f=head;
while(f!=null&&f.next!=null){
s=s.next;
f=f.next.next;
if(s==f){
return true;
}
}
return false;
}
leetcode--009 Linked List Cycle I的更多相关文章
- 【Leetcode】Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...
- [LeetCode] 141. Linked List Cycle 链表中的环
Given a linked list, determine if it has a cycle in it. Follow up:Can you solve it without using ext ...
- [LeetCode] 142. Linked List Cycle II 链表中的环 II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...
- Java for LeetCode 142 Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...
- 【算法分析】如何理解快慢指针？判断linked list中是否有环、找到环的起始节点位置。以Leetcode 141. Linked List Cycle, 142. Linked List Cycle II 为例Python实现
引入 快慢指针经常用于链表(linked list)中环(Cycle)相关的问题.LeetCode中对应题目分别是: 141. Linked List Cycle 判断linked list中是否有环 ...
- [Leetcode Week6]Linked List Cycle II
Linked List Cycle II 题解 题目来源:https://leetcode.com/problems/linked-list-cycle-ii/description/ Descrip ...
- [Leetcode Week6]Linked List Cycle
Linked List Cycle 题解 原创文章,拒绝转载 题目来源:https://leetcode.com/problems/linked-list-cycle/description/ Des ...
- [LeetCode] 142. Linked List Cycle II 单链表中的环之二
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. To r ...
- [LeetCode] 141. Linked List Cycle 单链表中的环
Given a linked list, determine if it has a cycle in it. To represent a cycle in the given linked lis ...
- 【题解】【链表】【Leetcode】Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...
随机推荐
- Oracle Sql优化之lead,lag分析函数
1.表中有四个字段:人员编号,开始时间,结束时间,类型,数据ID,需要实现如下需求 a.当类型为-1时,丢弃该记录 b.当类型为-1时,且前一行结束时间为null,当前行的开始时间-1作为前一行的结束 ...
- P2P应用中的NAT穿透问题
多年前曾经写过一个关于NAT钻洞的实验.现在发现那个做法在我现在的路由器上已经不管用了.经过一番搜索发现时过境迁,世界变化很快,新路由器已经是UPnP了.在这里重新理一下几种方法. 第一种,也是不太靠 ...
- Opencv 图像叠加 添加水印
Opencv 图像叠加 添加水印 C++: void Mat::copyTo(OutputArray m) const C++: void Mat::copyTo(OutputArray m, Inp ...
- JavaScript返回上一页并自动刷新
返回并刷新 <script>alert("恭喜您,操作成功!"); window.location.href=document.referrer; </scrip ...
- String转float
float mTotalhour = Float.parseFloat(mTotalHourEt.getText().toString().trim());
- zf-关于注册码过期
Webroot-index.jsp下 少写了个函数 导致登陆进去不能弹出注册码过期的对话框,函数如下 window.onload = function() { <ww:iterator valu ...
- JAVA Timer定时器使用方法(一)
设置定时任务很简单,用Timer类就搞定了. 一.延时执行首先,我们定义一个类,给它取个名字叫TimeTask,我们的定时任务,就在这个类的main函数里执行. 代码如下:package test;i ...
- DOS日期和时间 - Robin Hu的专栏 - 博客频道 - CSDN.NET
body { font-family: Microsoft YaHei UI,"Microsoft YaHei", Georgia,Helvetica,Arial,sans-ser ...
- Java正则表达式细节1
Java中使用特定的字符类别比如 \d \s \w \d 匹配数字 \s 匹配空白字符 \w 匹配数字或者字符或者下划线[a-zA-Z0-9_] 比如使员正则的时候: 使用的是2个 斜杠 @Test ...
- Commons Codec基本使用（转载）
在实际的应用中,我们经常需要对字符串进行编解码,Apache Commons家族中的Commons Codec就提供了一些公共的编解码实现,比如Base64, Hex, MD5,Phonetic an ...