本文主要是介绍环形链表练习题笔记,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
参考大佬题解
141. 环形链表 - 力扣(LeetCode)
环形链表
141. 环形链表 - 力扣(LeetCode)
/*** Definition for singly-linked list.* class ListNode {* int val;* ListNode next;* ListNode(int x) {* val = x;* next = null;* }* }*/
public class Solution {public boolean hasCycle(ListNode head) {ListNode slow=head;ListNode fast=head;while(true){if(fast==null||fast.next==null){return false;}slow=slow.next;fast=fast.next.next;if(slow==fast)return true;}}
}
环形链表II
142. 环形链表 II - 力扣(LeetCode)
/*** Definition for singly-linked list.* class ListNode {* int val;* ListNode next;* ListNode(int x) {* val = x;* next = null;* }* }*/
public class Solution {public ListNode detectCycle(ListNode head) {ListNode slow=head;ListNode fast=head;while(true){if(fast==null||fast.next==null){return null;}slow=slow.next;fast=fast.next.next;if(slow==fast)break;}fast=head;while(fast!=slow){fast=fast.next;slow=slow.next;}return fast;}
}
题解思路:追及相遇问题
142. 环形链表 II - 力扣(LeetCode)
快乐数
202. 快乐数 - 力扣(LeetCode)
class Solution {public boolean isHappy(int n) {int fast = n;int slow = n;while(true){fast=getnext(fast);fast=getnext(fast);slow=getnext(slow);if(fast==1) return true;if(fast==slow) return false;}}int getnext(int n){
int sum=0;
int help=0;while(n>0){help=n%10;sum+=help*help;n=n/10;
}return sum;}
解题思路:
202. 快乐数 - 力扣(LeetCode)
这篇关于环形链表练习题笔记的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!