Any help?

Question about the task

Under discussion

Ideally it should be just one person, but when I try to verify the code it shows an error as display the names in ascending order which share the highest sum. So I tried to change the code to make it a list of people who has highest and same sum. but still not verifying and giving me an error as "be sure that the program displays names with the highest sum"

The first parameter of the main method is a file name.
Each line of the specified file has the following format:
name value
where [name] is a String and [value] is a double. [name] and [value] are separated by a space.

Find the sum of all the values for each name.
Display in alphabetical order the names with the highest sum.
Separate the names with a space or new line.
Close the streams.

Example input file:
Peterson 0.501 Smith 1.35 Peterson 0.85

Example output:
Peterson

Requirements:

The program must NOT read data from the console.
The program must read the file's contents (use FileReader).
The file input stream (FileReader) must be closed.
The program should output the names with the highest sum to the console.

package com.codegym.task.task19.task1920; /* The richest */ import java.io.FileReader; import java.io.BufferedReader; import java.util.*; import java.util.HashMap; import java.util.TreeMap; import java.io.FileNotFoundException; import java.io.IOException; public class Solution { public static void main(String[] args) throws IOException { FileReader reader = new FileReader(args[0]); BufferedReader br = new BufferedReader(reader); Map<String,Double> map = new TreeMap<>(); String line; while((line = br.readLine()) != null) { String[] lineArr = line.split(" "); if(map.containsKey(lineArr[0].trim())){ map.put(lineArr[0].trim(), map.get(lineArr[0].trim()) + Double.parseDouble(lineArr[1])); }else{ map.put(lineArr[0].trim(), Double.parseDouble(lineArr[1])); } } reader.close(); br.close(); ArrayList<String> richestPerson = new ArrayList<>(); double maxValue = Integer.MIN_VALUE; for(Map.Entry<String, Double> pair:map.entrySet()){ if(pair.getValue() >= maxValue){ maxValue = pair.getValue(); richestPerson.add(pair.getKey()); } } Collections.sort(richestPerson); for(String name : richestPerson){ System.out.println(name); } } }

Comments (2)

Popular
New
Old

You must be signed in to leave a comment

shovan

Level 22 , Kolkata, india

18 January 2020, 04:22

i have done this...please give me a like

import java.io.*;
import java.util.*;
/*
The richest

*/

public class Solution {
    public static void main(String[] args) throws Exception {

            BufferedReader br = new BufferedReader(new FileReader(args[0]));
            ArrayList<String> result = new ArrayList<String>();

            String data;
            String[] dataArray;
            Map<String, Double> map = new TreeMap<>();

            while(br.ready()){
                data = br.readLine();
                dataArray = data.split(" ");

                if(map.containsKey(dataArray[0]))
                    map.replace(dataArray[0], map.get(dataArray[0]) + Double.parseDouble(dataArray[1]));
                else
                    map.put(dataArray[0], Double.parseDouble(dataArray[1]));
            }
            double maxValue = Integer.MIN_VALUE;

            for(Map.Entry<String, Double> pair:map.entrySet()){
                if(pair.getValue() > maxValue){
                    maxValue = pair.getValue();
                }
            }
            for(Map.Entry<String, Double> pair:map.entrySet())
            {
                if(pair.getValue() == maxValue || pair.getValue() >= (maxValue - 1))
                {
                    result.add(pair.getKey());
                }
            }
            Collections.sort(result);
            for(String l : result)
            {
                for(Map.Entry<String, Double> pair:map.entrySet())
                {
                    if(l.equals(pair.getKey()))
                    {
                        System.out.println(pair.getKey());
                    }
                }
            }
            br.close();
    }
}

Ivaylo Trifonov

Level 22 , Madrid, Spain

19 October 2019, 17:33

I don`t know if You resolved this task. But I find the solution to this problem after 5 attempts... Personally I think that the requirements are a bit confusing or unclear. I mean, what they want from us to do: "The program should output the names with the highest sum to the console"? How many of the names? The first two? If we have only 2 names, then the half? I solved it adding a comparison looping through the map if the sum is equal to the max sum or if the sum is equal to the max sum minus one then displays the name. I noticed that in Your case You get only one name printed (or maybe two, if they have equal sum) because Your method searches for sum equal or greatest of the maxValue, this is always false, it can`t be greater if You already looped thru the map and checked all the values. I hope I helped somehow. Greetings.