Commit 1205ff0

authored

Create 3459.Length-of-Longest-V-Shaped-Diagonal-Segment.cpp

1 parent e38792b commit 1205ff0Copy full SHA for 1205ff0

File tree

1 file changed

+59

-0

lines changed

DFS/3459.Length-of-Longest-V-Shaped-Diagonal-Segment
- 3459.Length-of-Longest-V-Shaped-Diagonal-Segment.cpp

1 file changed

+59

-0

lines changed

`‎DFS/3459.Length-of-Longest-V-Shaped-Diagonal-Segment/3459.Length-of-Longest-V-Shaped-Diagonal-Segment.cpp‎`

Lines changed: 59 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,59 @@`
	`1`	`+class Solution {`
	`2`	`+ vector<pair<int,int>>dir;`
	`3`	`+ int memo[501][501][4][2];`
	`4`	`+public:`
	`5`	`+ int lenOfVDiagonal(vector<vector<int>>& grid)`
	`6`	`+ {`
	`7`	`+ int m = grid.size(), n = grid[0].size();`
	`8`	`+ int ret = 0;`
	`9`	`+ dir = {{-1,1},{1,1},{1,-1},{-1,-1}};`
	`10`	`+`
	`11`	`+ for (int i=0; i<m; i++)`
	`12`	`+ for (int j=0; j<n; j++)`
	`13`	`+ {`
	`14`	`+ if (grid[i][j]==1)`
	`15`	`+ {`
	`16`	`+ ret = max(ret, dfs(grid,i,j,0,1));`
	`17`	`+ ret = max(ret, dfs(grid,i,j,1,1));`
	`18`	`+ ret = max(ret, dfs(grid,i,j,2,1));`
	`19`	`+ ret = max(ret, dfs(grid,i,j,3,1));`
	`20`	`+ }`
	`21`	`+ }`
	`22`	`+ return ret;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ bool canContinue(int a, int b)`
	`26`	`+ {`
	`27`	`+ if (a==1 && b!=2) return false;`
	`28`	`+ if (a==2 && b!=0) return false;`
	`29`	`+ if (a==0 && b!=2) return false;`
	`30`	`+ return true;`
	`31`	`+ }`
	`32`	`+ bool inbound(int i, int j, int m, int n)`
	`33`	`+ {`
	`34`	`+ return i>=0 && i<m && j>=0 && j<n;`
	`35`	`+ }`
	`36`	`+`
	`37`	`+ int dfs(vector<vector<int>>& grid, int x, int y, int k, int t)`
	`38`	`+ {`
	`39`	`+ if (memo[x][y][k][t]!=0) return memo[x][y][k][t];`
	`40`	`+`
	`41`	`+ int m = grid.size(), n = grid[0].size();`
	`42`	`+ int ret = 1;`
	`43`	`+`
	`44`	`+ int i = x+dir[k].first, j = y+dir[k].second;`
	`45`	`+`
	`46`	`+ if (inbound(i,j,m,n) && canContinue(grid[x][y], grid[i][j]))`
	`47`	`+ ret = max(ret, 1 + dfs(grid,i,j,k,t));`
	`48`	`+`
	`49`	`+ if (t==1)`
	`50`	`+ {`
	`51`	`+ int kk=(k+1)%4;`
	`52`	`+ i = x+dir[k].first, j = y+dir[k].second;`
	`53`	`+ if (inbound(i,j,m,n) && canContinue(grid[x][y], grid[i][j]))`
	`54`	`+ ret = max(ret, 1 + dfs(grid,i,j,kk,0));`
	`55`	`+ }`
	`56`	`+ memo[x][y][k][t] = ret;`
	`57`	`+ return ret;`
	`58`	`+ }`
	`59`	`+};`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 1205ff0

File tree

1 file changed

1 file changed

`‎DFS/3459.Length-of-Longest-V-Shaped-Diagonal-Segment/3459.Length-of-Longest-V-Shaped-Diagonal-Segment.cpp‎`

0 commit comments