golang多维度排序及题解最长连续序列

func main() {
    type PersonAge struct {
        Name  string
        Age   int
        Hight int
    }
    ps := []PersonAge{
        {"bo", 31, 333},
        {"ao", 42, 34},
        {"ao", 41, 23423},
        {"ao", 40, 23423},
        {"ao", 45, 12},
        {"co", 17, 3434},
        {"do", 26, 2343},
    }
    sort.Slice(ps, func(i, j int) bool {
        //!=  有大小时排序，相等时，下一个选项的优先级
        if ps[i].Name != ps[j].Name {
            return ps[i].Name < ps[j].Name
        }
        if ps[i].Hight != ps[j].Hight {
            return ps[i].Hight < ps[j].Hight
        }
        return ps[i].Age < ps[j].Age
    })
    log.Println(ps)
    return
}

//排序
func longestConsecutive(nums []int) int {
    if len(nums) == 0 {
        return 0
    }
    sort.Ints(nums)
    long := 1
    lst := 1
    tmp := nums[0]
    for i, _ := range nums {
        if nums[i] == tmp+1 {
            long++
            lst = max(lst, long)
            tmp = nums[i]
        } else if nums[i] == tmp {
            continue
        } else {
            long = 1
            tmp = nums[i]
        }
    }
    return lst
}
func max(a,b int)int{
    if a>b{
        return a
    }
    return b
}