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 ...
随机推荐
- 简单日历，纯js
<!DOCTYPE HTML> <html> <head> <meta http-equiv="Content-Type" content ...
- 2016.10.08--Intel Code Challenge Final Round--D. Dense Subsequence
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa ...
- struts2+ajax实现异步验证
由于老师布置作业的需要,在添加管理员的时候,要实现验证添加的管理员的用户名是否在数据库中已经存在,然后再客户端给用户一个提示.我首先想到的就是利用ajax实现异步验证技术,由于利用的ssh框架,所以在 ...
- Ubuntu下安装Node.js
下载Linux Binaries (.tar.gz)二进制包 解压 重命名为node 移动到/usr/local/目录下 创建软连接 ln -s /usr/local/node/bin/node ...
- 转：SQL Case when 的使用方法
Case具有两种格式.简单Case函数和Case搜索函数. --简单Case函数 CASE sex WHEN '1' THEN '男' WHEN '2' THEN '女' ELSE '其他' END ...
- C++：预处理指令
Preprocessor directives 预处理器指令 预处理器指令是指那些包含在我们代码中的预处理器语句行,这些预处理器语句不是真正的代码语句,但是他们指导程序如何进行编译.这些语句总是以 ‘ ...
- 关于VC中的错误处理
include <exception> try {} cache(exception &e) { cout<<e.what()<<endl; } 但 ...
- win10系统安装oracle11g时遇到INS-13001环境不满足最低要求
升级win10系统之后,需要重新安装Oracle,因为在安装Oralce11g时,使用64位的会出现各种不兼容问题,我每次安装都是使用32位的数据库. 在安装时点击setup.exe之后,出现了:[I ...
- C++Builder 中动态数组的使用（转）
源:http://i.cnblogs.com/EditPosts.aspx?opt=1 和AnsiString类型一样,动态数组是为了和DELPHI中的动态数组相兼容而定义,在BCB中,动态数组是用模 ...
- js_设置光标到文本的最后位置
div_right_table_tr1_td3_input2.focus(function(){ if(input1.setSelectionRange){//火狐 input1.setSelecti ...