Golang Binary.Iterative示例

示例#1

文件： threesum.go 项目： foysal-mamun/data-structures-and-algorithms-with-golang

// may be it not working perfectly :(, but it very fast
func (ts *threesum) TriplesCountFast() int {

	is := sort.Insertion{ts.nums}
	is.Sort()

	cnt := 0
	for i, vi := range is.A {
		for j, vj := range is.A[i+1:] {
			bs := search.Binary{A: is.A[j+1:], X: -(vi + vj)}
			k := bs.Iterative(0, len(bs.A)-1)
			if k > j {
				cnt += 1
			}
		}
	}

	return cnt
}