[英]how do i match the index of two parallel arrays?
我在文本文件中有一个在名称和年龄之间交替的列表。 有9个名字和9个年龄。
我需要我的程序才能显示
人(在此插入姓名)的年龄最高:(在此插入年龄)。
到目前为止,这是我的代码:
public class Names
{
public static void main(String[] args) throws Exception
{
// get textfile
Scanner input = new Scanner( new File("names_and_ages.txt") );
final String[] names= new String[9];
final int[] ages= new int[9];
int counter = 0;
while (input.hasNext()) //while not end-of-file
{
names[counter]=input.next();
ages[counter]=Integer.parseInt(input.next());
counter++;
}
highestAge(names, ages);
input.close();
}//end of main
public static void highestAge (String[] name, int[] age)
{
String name;
int count = 0;
int oldest = highestAge[count];
for ( int number: highestAge)
{
if (number > oldest)
{
oldest = number;
}
}
System.out.print("Person " + name + " has the highest age: " + oldest );
}//end of Size method
}//end of class
一切都编译了,我只是看不到使名称与年龄匹配。 救命?
如果创建了Person类,则可以省去管理两个数组的麻烦。
这将是您的Person类:
class Person {
String name;
int age;
}
public static void highestAge(String[] names, int[] ages)
{
//SET SENSIBLE DEFAULTS TO oldest AND index
int index = 0;
int oldest = ages[0];
//Looping based on index
for (int i = 0; i < ages.length; i++)
{
if (ages[i] > oldest)
{
index = i;
oldest = ages[i];
}
}
System.out.print("Person " + names[index] + " has the highest age: " + ages[index] );
}//end of Size method
你不远。 您需要维护最旧的年龄的“索引”,然后可以使用它在两个数组之间进行引用。
public static void highestAge (String[] names, int[] ages)
{
String name
int oldest = 0;
int oldestIndex = -1;
for (int index = 0; index < ages.length; index++)
{
if (ages[index] > oldest)
{
oldest = number;
oldestIndex = index;
}
}
System.out.print("Person " + names[oldestIndex] + " has the highest age: " + oldest );
}//end of Size method
另外,我不知道您的示例如何编译,我看不到highestAge
数组highestAge
任何地方声明了:P
就个人而言,我将创建一个名称和年龄作为字段的Person
类。
public class Person {
private String name;
private int age;
public Person(String name, int age) {
this.name = name;
this.age = age;
}
public String getName() {
return name;
}
public int getAge() {
return age;
}
}
然后,我将在循环的每次迭代中创建一个新的Person
并将它们添加到人员数组中( Person[] people = new Person[...]
)(实际上,我将使用java.util.list
的实现java.util.list
但就是我)
突然间,您将获得大量创造力。
您可以提供isOlderThen(Person person)
方法来比较人们。
if (person.isOlderThen(oldest)) {
oldest = person;
}
您实际上只是使用Arrays.sort
和Comparator
根据每个人的年龄对数组进行Arrays.sort
1)创建一个类
class person
{
String name;
int age;
}
2)仅创建一个数组:Person []人
3)重写方法highestAge
Person getOldest( Person[] persons )
{
Person oldest = null;
for( Person person : persons )
{
if( oldest == null || person.age > oldest.age )
{
oldest = person;
}
}
return oldest;
}
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.