您的位置:首页 > 产品设计 > UI/UE

LeetCode 406. Queue Reconstruction by Height

2016-12-17 21:20 796 查看
public class Solution {
public int[][] reconstructQueue(int[][] people) {
int l = people.length;
if (l == 1) return people;
for (int i = l - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (people[i][1] < people[j][1]) {
int[] tmp = people[i];
people[i] = people[j];
people[j] = tmp;
} else if (people[i][1] == people[j][1] && people[i][0] < people[j][0]) {
int[] tmp = people[i];
people[i] = people[j];
people[j] = tmp;
}
}
}
for (int i = 1; i < l; i++) {
int count = 0;
for (int j = 0; j < i; j++) {
if (people[i][0] <= people[j][0]) count++;
if (people[i][1] < count) {
int[] tmp = people[i];
for (int k = i; k >= j + 1; k--) people[k] = people[k - 1];
people[j] = tmp;
break;
}
}
}
return people;
}
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: