题目描述:
有个马戏团正在设计叠罗汉的表演节目,一个人要站在另一人的肩膀上。出于实际和美观的考虑,在上面的人要比下面的人矮一点且轻一点。已知马戏团每个人的身高和体重,请编写代码计算叠罗汉最多能叠几个人。
示例:
输入:height = [65,70,56,75,60,68] weight = [100,150,90,190,95,110]
输出:6
解释:从上往下数,叠罗汉最多能叠 6 层:(56,90), (60,95), (65,100), (68,110), (70,150), (75,190)
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/circus-tower-lcci
==============================================================================
题解:
public int bestSeqAtIndex(int[] height, int[] weight) {
int len = height.length;
int[][] arr = new int[len][2];
for (int i = 0; i < len; i++) {
arr[i] = new int[]{height[i], weight[i]};
}
//根据第一个元素排序
Arrays.sort(arr, (a, b) -> a[0] == b[0] ? b[1] - a[1] : a[0] - b[0]);
int[] tailArr= new int[len];
int tailArrSize=0;
for (int i = 0; i < len; i++) {
int location = Arrays.binarySearch(tailArr, 0, tailArrSize, arr[i][1]);
if(location<0){
location=-(location+1);
}
tailArr[location]=arr[i][1];
if(location==tailArrSize){
tailArrSize++;
}
}
return tailArrSize;
}