Scala检测链表环(leetCode 141)

https://leetcode-cn.com/problems/linked-list-cycle/
import scala.collection.mutable.HashSet
object Solution {
	/**
	* 哈希表法
	*/
    def hasCycle(head: ListNode): Boolean = {
        if(head == null || head.next == null){
            false
        }else{
            val visted_node = new HashSet[ListNode]()
            var flag = true
            var prev = head
            while(prev != null && flag){
                if(visted_node.contains(prev)){
                   flag =  false
                }else{
                    visted_node.append(prev)
                    prev = prev.next
                }
            }
            !flag
        }
    }


    /**
    * 快慢指针法
    */
    def hasCycle(head: ListNode): Boolean = {
        if(head == null || head.next == null){
           false 
        }else {
            var flag = true
            var slow = head
            var fast = head.next
            while(slow != fast && flag){
                if(fast == null || fast.next == null){
                    flag = false
                }
                if(flag){ //防止指针越界
                    slow = slow.next
                    fast = fast.next.next
                }
            }
            flag
        }
    }
}