hujun2020

```golang 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...

一看就会 一写就懵

```go func removeDuplicates(nums []int) int { res,dup,len:= 0,0,len(nums) for i:=0;i

简单题才能让我有一些存在感。。。。。（滑稽）

为什么中间断了几题 比如10 14

```go func mergeTwoLists(l1 *LinkList, l2 *LinkList) *LinkList { head := &LinkList{Next:l1} //虚拟头结点 cur := head for l1 != nil && l2 !=nil{ if l1.Val>=l2.Val{ cur.Next=l2 l2 = l2.Next }else {...

有个类似letcode的检测工具就好了 确保自己的方案测试覆盖率和beat100啥的

给我留点头发

只会暴力第四种解法

> @halfrost > @hujun2020 解法三和解法二还可以理解理解。解法一就算了。面试也不会考到解法一，感兴趣可以看看我画的图。 这该死的的数学抽象思维