标签:转移 span 动态规划 排序 输出 code div 状态 规划
1 public int maxEnvelopes(int[][]envelopes) { 2 int esize = envelopes.length; 3 if(esize==0)return 0; 4 if(esize==1)return 1; 5 int ans = 1; 6 int t1 = 0,t2 = 0; 7 for(int i = esize-1;i>0;i--) { 8 for(int j = 0;j<i;j++) { 9 if(envelopes[j][0]>envelopes[j+1][0]) { 10 t1 = envelopes[j][0]; 11 envelopes[j][0] = envelopes[j+1][0]; 12 envelopes[j+1][0] = t1; 13 t2 = envelopes[j][1]; 14 envelopes[j][1] = envelopes[j+1][1]; 15 envelopes[j+1][1] = t2; 16 }else if((envelopes[j][0]==envelopes[j+1][0])&&(envelopes[j][1]>envelopes[j+1][1])) { 17 t2 = envelopes[j][1]; 18 envelopes[j][1] = envelopes[j+1][1]; 19 envelopes[j+1][1] = t2; 20 } 21 } 22 } 23 int[]dp = new int[esize]; 24 Arrays.fill(dp,1); 25 for(int i = 1;i<esize;i++) { 26 for(int j = 0;j<i;j++) 27 if(envelopes[j][0]<envelopes[i][0] && envelopes[j][1]<envelopes[i][1])dp[i] = Math.max(dp[i],dp[j]+1); 28 ans = Math.max(ans, dp[i]); 29 } 30 return ans; 31 }
标签:转移 span 动态规划 排序 输出 code div 状态 规划
原文地址:https://www.cnblogs.com/messi2017/p/9943452.html