类型1：一个队列，左右两侧拿数据
思路
- dp[n][n] //代表当前先手能拿到的最优解
- 先手拿完最优解，后手会拿当前情况下的最优解，下边公式有体现
- d p [ i ] [ j ] = { a r r [ i ] ( i = = j ) m a x O r m i n ( a r r [ i ] , a r r [ j ] ) ( i = = j − 1 ) m a x O r m i n ( a r r [ i ] + m a x O r m i n ( d p [ i + 1 ] [ j − 1 ] , d p [ i + 2 ] [ j ] ) , a r r [ i ] + m a x O r m i n ( d p [ i + 1 ] [ j − 1 ] , d p [ i ] [ j − 2 ] ) ) dp[i][j]=\left\{ \begin{aligned} arr[i] &&(i == j) \\ maxOrmin(arr[i], arr[j])&&(i == j -1)\\ maxOrmin( arr[i] + maxOrmin(dp[i + 1][j - 1], dp[i + 2][j]), arr[i] + maxOrmin(dp[i + 1][j - 1], dp[i][j - 2]) ) \end{aligned} \right. dp[i][j]=⎩⎪⎨⎪⎧arr[i]maxOrmin(arr[i],arr[j])maxOrmin(arr[i]+maxOrmin(dp[i+1][j−1],dp[i+2][j]),arr[i]+maxOrmin(dp[i+1][j−1],dp[i][j−2]))(i==j)(i==j−1)
扫一扫
250
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
