題目要求

題目鏈接

分析

把平臺定義為一個類，四個屬性：ID（輸入的順序）、高度、左邊界、右邊界。

要根據(jù)高度排序，再找到指定的平臺，找符合要求的平臺即可。

AC代碼（Java語言描述）

import java.util.Arrays; import java.util.Comparator; import java.util.Objects; import java.util.Scanner;public class Main {private static class Platform {int id;int height;int left;int right;Platform(int id, int height, int left, int right) {this.id = id;this.height = height;this.left = left;this.right = right;}@Overridepublic boolean equals(Object o) {if (this == o) return true;if (o == null || getClass() != o.getClass()) return false;Platform platform = (Platform) o;return id == platform.id;}@Overridepublic int hashCode() {return Objects.hash(id);}}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);int num = scanner.nextInt();Platform[] platforms = new Platform[num];for (int i = 0; i < num; i++) {platforms[i] = new Platform(i, scanner.nextInt(), scanner.nextInt(), scanner.nextInt());}scanner.close();Platform[] sortedPlatforms = Arrays.copyOf(platforms, num);Arrays.sort(sortedPlatforms, Comparator.comparing(e->-e.height));for (Platform platform : platforms) {StringBuilder result = new StringBuilder();boolean flag = false;int i = 0;for (; i < num; i++) {Platform temp = sortedPlatforms[i];if (temp.equals(platform)) {i++;break;}}for (; i < num; i++) {Platform temp = sortedPlatforms[i];if (platform.left > temp.left && platform.left < temp.right) {result.append(temp.id+1).append(' ');flag = true;break;}}if (!flag) {result.append(0).append(' ');}flag = false;i = 0;for (; i < num; i++) {Platform temp = sortedPlatforms[i];if (temp.equals(platform)) {i++;break;}}for (; i < num; i++) {Platform temp = sortedPlatforms[i];if (platform.right > temp.left && platform.right < temp.right) {result.append(temp.id+1);flag = true;break;}}if (!flag) {result.append(0);}System.out.println(result);}}} 創(chuàng)作挑戰(zhàn)賽新人創(chuàng)作獎勵來咯，堅持創(chuàng)作打卡瓜分現(xiàn)金大獎

總結(jié)

以上是生活随笔為你收集整理的平台（洛谷P1105题题解，Java语言描述）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。