Declare variable scoreToGrade as a HashMap with Character key type and Double value type, representing a grade and the minimum score of the grade. Read integer numToRead from input. Then read numToRead key-value pairs from input and insert each into scoreToGrade. If the key already exists, replace the key's existing value with the new value. Ex: If the input is: 3 D 60.0 A 89.0 A 90.5 then one possible output is: Key: D, Value: 60.0 Key: A, Value: 90.5 Note: The order of the keys is not guaranteed in a HashMap. import java.util.Scanner; import java.util.HashMap; public class GradeScale { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); char assignedGrade; double minScore; int numToRead; int i; /* Any variable declarations go here */ /* Your code goes here */ // For each key in the HashMap, retrieve the value associated with the key for (Character key : scoreToGrade.keySet()) { System.out.println("Key: " + key + ", Value: " + scoreToGrade.get(key)); } } }
8.3.2: HashMap with enhanced for loop.
Declare variable scoreToGrade as a HashMap with Character key type and Double value type, representing a grade and the minimum score of the grade. Read integer numToRead from input. Then read numToRead key-value pairs from input and insert each into scoreToGrade. If the key already exists, replace the key's existing value with the new value.
Ex: If the input is:
3 D 60.0 A 89.0 A 90.5
then one possible output is:
Key: D, Value: 60.0 Key: A, Value: 90.5
Note: The order of the keys is not guaranteed in a HashMap.
import java.util.Scanner;
import java.util.HashMap;
public class GradeScale {
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
char assignedGrade;
double minScore;
int numToRead;
int i;
/* Any variable declarations go here */
/* Your code goes here */
// For each key in the HashMap, retrieve the value associated with the key
for (Character key : scoreToGrade.keySet()) {
System.out.println("Key: " + key + ", Value: " + scoreToGrade.get(key));
}
}
}
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
