Commit5556806

committed

add new files

1 parentb61dba0 commit5556806Copy full SHA for 5556806

File tree

+120

-0

lines changed

+120

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,26 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+import"math"`
	`4`	`+`
	`5`	`+/**`
	`6`	`+只能进行两次交易，因此一共有四个状态，互相之间转移`
	`7`	`+*/`
	`8`	`+`
	`9`	`+funcmaxProfit(prices []int)int {`
	`10`	`+b1,b2:=math.MinInt32,math.MinInt32`
	`11`	`+s1,s2:=0,0`
	`12`	`+fori:=0;i<len(prices);i++ {`
	`13`	`+b1=max(b1,-prices[i])`
	`14`	`+s1=max(s1,b1+prices[i])`
	`15`	`+b2=max(b2,s1-prices[i])`
	`16`	`+s2=max(s2,b2+prices[i])`
	`17`	`+}`
	`18`	`+returns2`
	`19`	`+}`
	`20`	`+`
	`21`	`+funcmax(x,yint)int {`
	`22`	`+ifx>y {`
	`23`	`+returnx`
	`24`	`+}`
	`25`	`+returny`
	`26`	`+}`

Lines changed: 46 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,46 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+/**`
	`4`	`+TODO not AC yet`
	`5`	`+*/`
	`6`	`+funcsolve(board [][]byte) {`
	`7`	`+l1:=len(board)`
	`8`	`+ifl1==0 {`
	`9`	`+return`
	`10`	`+}`
	`11`	`+l2:=len(board[0])`
	`12`	`+ifl2==0 {`
	`13`	`+return`
	`14`	`+}`
	`15`	`+//初始化访问数组`
	`16`	`+visit:=make([][]bool,l1)`
	`17`	`+fori:=0;i<l1;i++ {`
	`18`	`+visit[i]=make([]bool,l2)`
	`19`	`+}`
	`20`	`+fori:=0;i<l1;i++ {`
	`21`	`+forj:=0;j<l2;j++ {`
	`22`	`+if!visit[i][j] {`
	`23`	`+helper(board,visit,i,j)`
	`24`	`+}`
	`25`	`+}`
	`26`	`+}`
	`27`	`+}`
	`28`	`+`
	`29`	`+funchelper(board [][]byte,visit [][]bool,x,yint)bool {`
	`30`	`+ifx<0\|\|x>=len(board)\|\|y<0\|\|y>=len(board[0]) {`
	`31`	`+returnfalse`
	`32`	`+}`
	`33`	`+ifvisit[x][y] {`
	`34`	`+returnboard[x][y]!='O'`
	`35`	`+}`
	`36`	`+visit[x][y]=true`
	`37`	`+flag:=true`
	`38`	`+ifboard[x][y]=='O' {`
	`39`	`+board[x][y]='X'`
	`40`	`+flag=helper(board,visit,x+1,y)&&helper(board,visit,x-1,y)&&helper(board,visit,x,y+1)&&helper(board,visit,x,y-1)`
	`41`	`+ifflag==false {`
	`42`	`+board[x][y]='O'`
	`43`	`+}`
	`44`	`+}`
	`45`	`+returnflag`
	`46`	`+}`

Lines changed: 48 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,48 @@`
	`1`	`+package main`
	`2`	`+`
	`3`	`+/**`
	`4`	`+节点顺序入栈`
	`5`	`+*/`
	`6`	`+funcaddTwoNumbers(l1ListNode,l2ListNode)*ListNode {`
	`7`	`+len1,len2:=0,0`
	`8`	`+fortmp:=l1;tmp!=nil;tmp=tmp.Next {`
	`9`	`+len1++`
	`10`	`+}`
	`11`	`+fortmp:=l2;tmp!=nil;tmp=tmp.Next {`
	`12`	`+len2++`
	`13`	`+}`
	`14`	`+iflen1<len2 {`
	`15`	`+l1,l2,len1,len2=l2,l1,len2,len1`
	`16`	`+}`
	`17`	`+s1,s2:=make([]ListNode,0,len1),make([]ListNode,0,len2)`
	`18`	`+fortmp:=l1;tmp!=nil;tmp=tmp.Next {`
	`19`	`+s1=append(s1,tmp)`
	`20`	`+}`
	`21`	`+fortmp:=l2;tmp!=nil;tmp=tmp.Next {`
	`22`	`+s2=append(s2,tmp)`
	`23`	`+}`
	`24`	`+`
	`25`	`+varheadListNode`
	`26`	`+add,i,t:=0,0,0`
	`27`	`+fori=1;i<=len1;i++ {`
	`28`	`+ifi<=len2 {`
	`29`	`+t=s1[len1-i].Val+s2[len2-i].Val+add`
	`30`	`+}else {`
	`31`	`+t=s1[len1-i].Val+add`
	`32`	`+}`
	`33`	`+add=t/10`
	`34`	`+node:=&ListNode{`
	`35`	`+t%10,`
	`36`	`+head.Next,`
	`37`	`+}`
	`38`	`+head.Next=node`
	`39`	`+}`
	`40`	`+ifadd>0 {`
	`41`	`+node:=&ListNode{`
	`42`	`+add,`
	`43`	`+head.Next,`
	`44`	`+}`
	`45`	`+head.Next=node`
	`46`	`+}`
	`47`	`+returnhead.Next`
	`48`	`+}`

Comments

(0)