static int pick(int[] peaches) { int length = peaches.length,maxSize = 0; int[] incSize = new int[length]; for (int i = 0; i < length; i++) incSize[i] = 1; for (int i = 1; i < length; i++) for (int j = 0; j < i; j++) if (peaches[j] <= peaches[i]) { incSize[i] = Math.max(incSize[j] + 1, incSize[i]); maxSize = Math.max(incSize[i], maxSize); } return maxSize; }
点赞 4

相关推荐

点赞 评论 收藏
分享
牛客网
牛客网在线编程
牛客网题解
牛客企业服务