摘要:
package main import "fmt" type ListNode struct{ val int next *ListNode } func hasCycle(head *ListNode) bool{ if head == nil || head.next == nil{ retur 阅读全文
摘要:
package main import "fmt" func upper_bound_ (v int, a[] int) int{ len_a := len(a) left := 0 right := len_a - 1 for { mid := left + (right - left) / 2 阅读全文