要求是获取航空公司的用户输入及其费率。然后我们必须显示基于航空公司费率排序的组合阵列。
例如: 以下条目是数组形式的用户输入,其数量和描述可根据用户的需要而变化。输入数组将合并并进行排序
输入承运人列表:
Air India
Lufthansa
Emirates
Etihad
British Airways
输入费用:
500
350
400
550
450
输出:
Lufthansa-350
Emirates-400
British Airways-450
Air India-500
Emirates-550
即组合阵列将根据运营商的成本进行分类。 我的代码:
import java.util.Scanner;
public class Main {
public static void main(String args[]){
// fill the code
int n,i,temp;
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
int a[] = new int[n];
String b[] = new String[n];
for (i=0;i<n;i++)
{
b[i] = sc.next();
}
for (i=0;i<n;i++)
{
a[i] = sc.nextInt();
}
for (i=0;i<n;i++)
{
System.out.println("Details are :"+(b[i]+"-"+a[i]));
}
for ( i = 0; i < n; i++)
{
for (int j = i + 1; j < n; j++)
{
if ((a[i]) > (a[j]))
{
temp = (a[i]);
(a[i]) = (a[j]);
(a[j]) = temp;
}
}
}
System.out.println("Sorted are :"+(b[i]+"-"+a[i]));
}
}
答案 0 :(得分:2)
import java.util.*;
public class Mapp {
public static void main(String[] args) {
// TODO Auto-generated method stub
Map<Integer,String> mp=new TreeMap<>();
mp.put(500,"Air India");
mp.put(350,"Lufthansa");
mp.put(400,"Emirates");
mp.put(550,"Etihad");
mp.put(450,"British Airways");
Set mapset=mp.entrySet();
System.out.println(mp);
}
}
如果您希望用户输入值
:import java.util。*;
public class Mapp {
public static void main(String[] args) {
// TODO Auto-generated method stub
Map<Integer,String> mp=new TreeMap<>();
System.out.println("Enter number of Entries: ");
Scanner sc=new Scanner(System.in);
int et=0;
et=sc.nextInt();
while(et!=0)
{
System.out.println("Enter Cost");
int cost=0;
Scanner cst=new Scanner(System.in);
cost=cst.nextInt();
System.out.println("Enter Airline Service");
Scanner name=new Scanner(System.in);
String nm=null;
nm=name.nextLine();
mp.put(cost,nm);
et--;
}
Set mapset=mp.entrySet();
System.out.println(mp);
}
}