hujun2020

看懂了算我输

> @chenqi146 > 我感觉挺好懂的呀 嗯 老简单了 我看你过几天还能不能自己写出来

居然用了sort包！！！

秀

思维跟不上啊 第一次遇到这种只是想到暴力解法先获取所有子字符串再判断重复长度 脑子不够用啊 还是一直没有培养算法和数学思维 难！

解题思路 太简单了 不太清晰

看着像那么回事 当时也可以默写下来 过几天再来写肯定某些细节就忘了。

像这种抽象的就难以捉摸 需要画思维导图

喜欢简单题

func letterCombinations(digits string) []string { all := map[string][]string{ "2":[]string{"a","b","c"}, "3":[]string{"d","e","f"}, "4":[]string{"g","h","i"}, "5":[]string{"j","k","l"}, "6":[]string{"m","n","o"}, "7":[]string{"p","q","r","s"}, "8":[]string{"t","u","v"}, "9":[]string{"w","x","y","z"}, } res ,tmp:= []string{},[]string{""} for _,v := range digits{ res = combineLetter(tmp,all[string(v)]) tmp =...