func getLeastNumbers(arr []int, k int) []int {
if len(arr) == 0 || k == 0 {
return []int{}
}
sort.Ints(arr)
return arr[:k]
}
简单题,简单写法,力大砖飞
func twoSum(nums []int, target int) []int {
myMap := make(map[int]int)
res := []int{}
cha := 0
for idx, num := range nums {
if num >= target {
break
}
cha = target - num
if _, ok := myMap[cha]; !ok {
myMap[num] = idx
} else {
res = []int{num, cha}
break
}
}
return res
}
这就是那个两数之和吧,用的哈希表
func isAnagram(s string, t string) bool {
if len(s) != len(t) {
return false
}
if len(s) == 1 {
return false
}
if s == t {
return false
}
for _, cha := range s {
if strings.Count(s, string(cha)) != strings.Count(t, string(cha)) {
return false
}
}
return true
}
还是自己写的,内存不错,速度有点拉跨
最近事多,还是要坚持写,只不过没有时间去优化了,加油