Commitdfc4c44

authored

Merge pull request6boris#114 from kylesliu/develop

update 241 problem solution

2 parents68d2473 +245ae98 commitdfc4c44Copy full SHA for dfc4c44

File tree

+87

-7

lines changed

+87

-7

lines changed

Lines changed: 51 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,55 @@`
`1`	`1`	`package Solution`
`2`	`2`
	`3`	`+import"strconv"`
	`4`	`+`
`3`	`5`	`funcdiffWaysToCompute(inputstring) []int {`
`4`		`-return []int{}`
	`6`	`+returnways(input,map[string][]int{})`
	`7`	`+}`
	`8`	`+`
	`9`	`+funccalculate(a,bint,operaterune)int {`
	`10`	`+switchoperate {`
	`11`	`+case'+':`
	`12`	`+returna+b`
	`13`	`+case'-':`
	`14`	`+returna-b`
	`15`	`+case'*':`
	`16`	`+returna*b`
	`17`	`+default:`
	`18`	`+panic("operate not exist")`
	`19`	`+}`
	`20`	`+}`
	`21`	`+`
	`22`	`+funcways(inputstring,cachemap[string][]int) []int {`
	`23`	`+if_,ok:=cache[input];ok {`
	`24`	`+returncache[input]`
	`25`	`+}`
	`26`	`+`
	`27`	`+ans:= []int{}`
	`28`	`+`
	`29`	`+fori:=0;i<len(input);i++ {`
	`30`	`+ch:=input[i]`
	`31`	`+`
	`32`	`+ifch=='+'\|\|ch=='-'\|\|ch=='*' {`
	`33`	`+left:=input[:i]`
	`34`	`+right:=input[i+1:]`
	`35`	`+`
	`36`	`+l:=ways(left,cache)`
	`37`	`+r:=ways(right,cache)`
	`38`	`+`
	`39`	`+for_,a:=rangel {`
	`40`	`+for_,b:=ranger {`
	`41`	`+ans=append(ans,calculate(a,b,rune(ch)))`
	`42`	`+}`
	`43`	`+}`
	`44`	`+}`
	`45`	`+}`
	`46`	`+`
	`47`	`+iflen(ans)==0 {`
	`48`	`+number,_:=strconv.Atoi(input)`
	`49`	`+ans=append(ans,number)`
	`50`	`+}`
	`51`	`+`
	`52`	`+cache[input]=ans`
	`53`	`+`
	`54`	`+returnans`
`5`	`55`	`}`

Lines changed: 11 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,6 @@`
`1`	`1`	`package Solution`
`2`	`2`
`3`	`3`	`import (`
`4`		`-"reflect"`
`5`	`4`	`"strconv"`
`6`	`5`	`"testing"`
`7`	`6`	`)`
`@@ -21,9 +20,17 @@ func TestSolution(t *testing.T) {`
`21`	`20`	`fori,c:=rangecases {`
`22`	`21`	`t.Run(c.name+" "+strconv.Itoa(i),func(t*testing.T) {`
`23`	`22`	`got:=diffWaysToCompute(c.inputs)`
`24`		`-if!reflect.DeepEqual(got,c.expect) {`
`25`		`-t.Fatalf("expected: %v, but got: %v, with inputs: %v",`
`26`		`-c.expect,got,c.inputs)`
	`23`	`+iflen(got)!=len(c.expect) {`
	`24`	`+t.Fatalf("expected: %v, but got: %v, with inputs: %v",c.expect,got,c.inputs)`
	`25`	`+}`
	`26`	`+m:=make(map[int]int)`
	`27`	`+forv:=rangegot {`
	`28`	`+m[v]++`
	`29`	`+}`
	`30`	`+forv:=rangec.expect {`
	`31`	`+if_,ok:=m[v];!ok {`
	`32`	`+t.Fatalf("expected: %v, but got: %v, with inputs: %v",c.expect,got,c.inputs)`
	`33`	`+}`
`27`	`34`	`}`
`28`	`35`	`})`
`29`	`36`	`}`

Lines changed: 25 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,8 +1,31 @@`
`1`	`1`	`package Solution`
`2`	`2`
	`3`	`+import"sort"`
`3`	`4`
`4`		`-`
	`5`	`+funcmax(a,bint)int {`
	`6`	`+ifa>b {`
	`7`	`+returna`
	`8`	`+}`
	`9`	`+returnb`
	`10`	`+}`
`5`	`11`
`6`	`12`	`funcleastInterval(tasks []byte,nint)int {`
`7`		`-return0`
	`13`	`+tmp:=make([]int,26)`
	`14`	`+temp:= []int{}`
	`15`	`+p:=1`
	`16`	`+for_,v:=rangetasks {`
	`17`	`+tmp[v-'A']++`
	`18`	`+}`
	`19`	`+for_,v:=rangetmp {`
	`20`	`+temp=append(temp,v)`
	`21`	`+}`
	`22`	`+sort.Slice(temp,func(a,bint)bool {`
	`23`	`+returntemp[a]>temp[b]`
	`24`	`+})`
	`25`	`+fori:=1;i<len(temp);i++ {`
	`26`	`+iftemp[0]==temp[i] {`
	`27`	`+p++`
	`28`	`+}`
	`29`	`+}`
	`30`	`+returnmax((n+1)*(temp[0]-1)+p,len(tasks))`
`8`	`31`	`}`

Comments

(0)