Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package DPM;
- import java.util.Arrays;
- import java.util.LinkedHashMap;
- import java.util.Scanner;
- public class Main {
- public static void main(String[] args){
- Scanner scan = new Scanner(System.in);
- double [] nums = Arrays.stream(scan.nextLine().split(" ")).mapToDouble(Double::parseDouble).toArray();
- LinkedHashMap<Double, Integer> sets = new LinkedHashMap<>();
- for (int i = 0; i < nums.length; i++) {
- if (sets.containsKey(nums[i])){
- sets.put(nums[i], sets.get(nums[i])+1);
- }else {
- sets.put(nums[i], 1);
- }
- }
- for (Double aDouble : sets.keySet()) {
- System.out.printf("%.1f -> %d", aDouble, sets.get(aDouble));
- System.out.println();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment