Commit36ab942

committed

add new files

1 parent35bde91 commit36ab942Copy full SHA for 36ab942

File tree

+120

-0

lines changed

+120

-0

lines changed

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,40 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+import (`
	`4`	`+"math"`
	`5`	`+)`
	`6`	`+`
	`7`	`+typeTreeNodestruct {`
	`8`	`+Valint`
	`9`	`+Left*TreeNode`
	`10`	`+Right*TreeNode`
	`11`	`+}`
	`12`	`+`
	`13`	`+varst []int`
	`14`	`+`
	`15`	`+funcinorder(root*TreeNode) {`
	`16`	`+ifroot==nil {`
	`17`	`+return`
	`18`	`+}`
	`19`	`+ifroot.Left!=nil {`
	`20`	`+inorder(root.Left)`
	`21`	`+}`
	`22`	`+ifroot!=nil {`
	`23`	`+st=append(st,root.Val)`
	`24`	`+}`
	`25`	`+ifroot.Right!=nil {`
	`26`	`+inorder(root.Right)`
	`27`	`+}`
	`28`	`+}`
	`29`	`+`
	`30`	`+funcgetMinimumDifference(root*TreeNode)int {`
	`31`	`+st=make([]int,0,256)`
	`32`	`+inorder(root)`
	`33`	`+ret:=math.MaxInt32`
	`34`	`+fori:=1;i<len(st);i++ {`
	`35`	`+if (st[i]-st[i-1])<ret {`
	`36`	`+ret=st[i]-st[i-1]`
	`37`	`+}`
	`38`	`+}`
	`39`	`+returnret`
	`40`	`+}`

Lines changed: 19 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,19 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+funcfindPairs(nums []int,kint)int {`
	`4`	`+iflen(nums)==0\|\|k<0 {`
	`5`	`+return0`
	`6`	`+}`
	`7`	`+m:=map[int]int{}`
	`8`	`+fork,v:=rangenums {`
	`9`	`+m[v]=k`
	`10`	`+}`
	`11`	`+res:=0`
	`12`	`+fori:=0;i<len(nums);i++ {`
	`13`	`+ifval,ok:=m[nums[i]+k];ok&&val!=i {`
	`14`	`+delete(m,nums[i]+k)`
	`15`	`+res++`
	`16`	`+}`
	`17`	`+}`
	`18`	`+returnres`
	`19`	`+}`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+funcreverseStr(sstring,kint)string {`
	`4`	`+t:= []byte(s)`
	`5`	`+forl:=0; ;l+=2*k {`
	`6`	`+r:=l+k-1`
	`7`	`+ifr>=len(t) {`
	`8`	`+r=len(t)-1`
	`9`	`+}`
	`10`	`+fori:=l;i<r;i,r=i+1,r-1 {`
	`11`	`+t[i],t[r]=t[r],t[i]`
	`12`	`+}`
	`13`	`+if (l+2*k)>=len(t) {`
	`14`	`+break`
	`15`	`+}`
	`16`	`+}`
	`17`	`+returnstring(t)`
	`18`	`+}`

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,28 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+varretint`
	`4`	`+`
	`5`	`+//直径等于left最大深度+right最大深度+1`
	`6`	`+funchelper(root*TreeNode)int {`
	`7`	`+ifroot==nil {`
	`8`	`+return0`
	`9`	`+}`
	`10`	`+left:=helper(root.Left)`
	`11`	`+right:=helper(root.Right)`
	`12`	`+ifret<left+right+1 {`
	`13`	`+ret=left+right+1`
	`14`	`+}`
	`15`	`+ifleft>right {`
	`16`	`+returnleft+1`
	`17`	`+}`
	`18`	`+returnright+1`
	`19`	`+}`
	`20`	`+`
	`21`	`+funcdiameterOfBinaryTree(root*TreeNode)int {`
	`22`	`+ret=0`
	`23`	`+helper(root)`
	`24`	`+ifret==0 {`
	`25`	`+returnret`
	`26`	`+}`
	`27`	`+returnret-1`
	`28`	`+}`

Lines changed: 15 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,15 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+import"strings"`
	`4`	`+`
	`5`	`+funccheckRecord(sstring)bool {`
	`6`	`+t:=strings.Count(s,"A")`
	`7`	`+ift>=2 {`
	`8`	`+returnfalse`
	`9`	`+}`
	`10`	`+t=strings.Count(s,"LLL")`
	`11`	`+ift>0 {`
	`12`	`+returnfalse`
	`13`	`+}`
	`14`	`+returntrue`
	`15`	`+}`

Comments

(0)