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的更多相关文章

  1. 【Leetcode】Linked List Cycle II

    Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...

  2. [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 ...

  3. [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 ...

  4. 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 ...

  5. 【算法分析】如何理解快慢指针？判断linked list中是否有环、找到环的起始节点位置。以Leetcode 141. Linked List Cycle, 142. Linked List Cycle II 为例Python实现

    引入 快慢指针经常用于链表(linked list)中环(Cycle)相关的问题.LeetCode中对应题目分别是: 141. Linked List Cycle 判断linked list中是否有环 ...

  6. [Leetcode Week6]Linked List Cycle II

    Linked List Cycle II 题解 题目来源:https://leetcode.com/problems/linked-list-cycle-ii/description/ Descrip ...

  7. [Leetcode Week6]Linked List Cycle

    Linked List Cycle 题解 原创文章,拒绝转载 题目来源:https://leetcode.com/problems/linked-list-cycle/description/ Des ...

  8. [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 ...

  9. [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 ...

  10. 【题解】【链表】【Leetcode】Linked List Cycle II

    Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Foll ...

随机推荐

  1. CodeForces 681C Heap Operations（模拟）

    比较简单的模拟,建议使用STL优先队列. 代码如下: #include<iostream> #include<cstdio> #include<cstring> # ...

  2. 6--OC--封装 继承 多态

    OC中的类的三大特性类: 继承,封装,多态 一. 封装 封装就是对类中的一些字段,方法进行保护,不被外界所访问到,有一种权限的控制功能,这样我们在定义类的时候,哪些字段和方法不想暴露出去,哪些字段和方 ...

  3. C++：new 和 delete

    在 C++ 中 , 使用 new 操作符动态申请内存的时候,如果申请失败,则会抛出  bad_alloc异常 当使用  delete 释放一块内存的时候 , 有些编译器上delete 不能判断一块内存 ...

  4. Chapter 1 First Sight——11

    I didn't relate well to people my age. 我没有向人们叙述清楚我的年龄 Maybe the truth was that I didn't relate well ...

  5. 代码异味---Code smell

    程序员应该竭尽全力去写那些重复的代码.以下几点是我目前最需要改进的地方. 重复代码: 相同或者相似的代码存在于一个以上的地方. 长方法: 一个非常长的方法.函数或者过程. 巨类: 一个非常庞大的类. ...

  6. Ubuntu系统搭建PPTP，VPN

    1.先安装pptp apt-get install pptpd 2.打开pptp的DNS vim /etc/ppp/option.pptpd 去掉下面两行内容前的# ms-dns 8.8.8.8 ms ...

  7. 简单的划分数问题<划分问题>

    将整数n分成k份,且每份不能为空,任意两份不能相同(不考虑顺序). 例如:n=7,k=3,下面三种分法被认为是相同的. 1,1,5; 1,5,1; 5,1,1; 问有多少种不同的分法. 思路: 动态规 ...

  8. Mac 生产力探究

    转载自:http://devtian.me/2015/04/15/about-my-productivity-tool-in-MacOSX/ ##密码管理器 1Password 1Password 是 ...

  9. Mahout分布式运行实例：基于矩阵分解的协同过滤评分系统（一个命令实现文件格式的转换）

     Apr 08, 2014  Categories in tutorial tagged with Mahout hadoop 协同过滤  Joe Jiang 前言:之前配置Mahout时测试过一个简 ...

  10. 请教<context:component-scan/>和<mvc:annotation-driven/>的区别20

    http://www.iteye.com/problems/66133 FileSystemXmlApplicationContext