描述
现在正在举行龙舟比赛,我们现在获得了最后冲刺时的俯视图像,现在你要输出各条龙舟的名次。
这张图像由r行c列的字符组成,每行的最左边的字符表示起点,所以字符为’S’,最右边的字符为’F’。
并且确定在9行里有数字字符1..9,来表示每条龙舟的编号,保证包含数字的行里,只包含连续的相同的3个数字。其余地方都是字符’.’。
具体看样例。越靠近右边的龙舟排名越靠前。如果有并列的,那么他们的名次相同。
输入
第一行是两个整数r和c(10 ≤ r,c ≤ 50)。表示图像有r行,c列。
下面有r行字符,以字符’S’开头,’F’结尾,还含有数字字符和’.’字符。
保证只有9行含有数字字符,并且每行的数字字符完全相同,含有3个数字。
输出
9行,第i行表示i号龙舟的名次。
输入样例 输出样例
10 15 5
S..........222F 1
S.....111.....F 6
S...333.......F 3
S...555.......F 6
S.......444...F 6
S.............F 4
S......777....F 7
S..888........F 2
S........999..F
S...666.......F
AC代码
import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;
class Ship implements Comparable{
int rank;//排名
int distance;//距终点距离
int team;//队伍
String demo;//龙舟
public Ship() {
this.rank = 0;
this.distance = 0;
this.team = 0;
this.demo = "\0";
}
@Override
public int compareTo(Object o) {
return 0;
}
}
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int r = scanner.nextInt();
int c = scanner.nextInt();
Ship[] ships = new Ship[r];
//赋值demo
for (int i = 0; i < r; i++) {
Ship s = new Ship();
s.demo = scanner.next();
ships[i] = s;
}
//处理distance
for (int i = 0; i < r; i++) {
ships[i].distance = checkDistance(ships[i].demo, c);
}
//处理team
for (Ship ship : ships) {
ship.team = checkTeam(ship.demo, c);
}
//处理rank
//按distance升序排列
Arrays.sort(ships, new Comparator<Ship>() {
@Override
public int compare(Ship o1, Ship o2) {
return o1.distance - o2.distance;
}
});
int count = 1;
for (int i = 0; i < r - 1; i++) {
ships[i].rank = count;
if (ships[i].distance == ships[i + 1].distance) {
continue;
}
count++;
}
//按team升序排列
Arrays.sort(ships, new Comparator<Ship>() {
@Override
public int compare(Ship o1, Ship o2) {
return o1.team - o2.team;
}
});
//按team输出排名
for (int i = 0; i < r - 1; i++) {
System.out.println(ships[i].rank);
}
}
//拿到distance
public static int checkDistance(String s, int c) {
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) - '0' >= 1 && s.charAt(i) - '0' <= 9) {
return c - i - 4;
}
}
return c;
}
public static int checkTeam(String s, int c) {
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) - '0' >= 1 && s.charAt(i) - '0' <= 9) {
return s.charAt(i) - 48;
}
}
return 520;
}
}