HTMLify

LeetCode - Find the Largest Almost Missing Integer - Go
Views: 33 | Author: abh
func contain(target int, array []int) bool {
    for _, v := range array {
        if v == target {
            return true
        }
    }
    return false
}
func unique(array []int) []int {
    var u []int
    for _, v := range array {
        if !contain(v, u) {
            u = append(u, v)
        }
    }
    return u
}
func largestInteger(nums []int, k int) int {
    am := -1
    for _, n := range unique(nums) {
        var saf int
        for i:=0; i<len(nums)-k+1; i++ {
            for j:=0; j<k; j++ {
                if nums[i+j] == n {
                    saf++
                    break
                }
            }
        }
        if saf == 1 {
            if n > am {
                am = n
            }
        }
    }
    return am
}

Comments