Java BigDecimal

Sort by

recency

|

507 Discussions

|

  • + 0 comments

    import java.math.BigDecimal; import java.util.*; class Solution{ public static void main(String []args){ //Input Scanner sc= new Scanner(System.in); int n=sc.nextInt(); String []s=new String[n+2]; for(int i=0;i

        //Write your code here
        s = Arrays.copyOf(s, n);
    Arrays.sort(s, (a, b) -> new BigDecimal(b).compareTo(new BigDecimal(a)));
        //Output
        for(int i=0;i<n;i++)
        {
            System.out.println(s[i]);
        }
    }
    

    }

  • + 0 comments

    Here is Java BigDecimal solution - https://programmingoneonone.com/hackerrank-java-bigdecimal-problem-solution.html

  • + 0 comments

    using a PC bottleneck calculator can lead to better thermal and power management. A poorly matched system may cause some components to work harder than necessary, resulting in overheating or increased power consumption check your PC here. By ensuring a balanced system, the calculator helps maintain optimal operating temperatures and power efficiency, which in turn enhances system stability and extends hardware lifespan. In summary, a PC bottleneck calculator not only improves immediate performance and cost-effectiveness but also contributes to long-term system reliability and user satisfaction.

  • + 0 comments

    import java.io.; import java.util.; import java.math.; import java.util.Arrays.;

    class Pair{ String input; BigDecimal value;

    public Pair(String input, BigDecimal value){
        this.input = input;
        this.value = value;
    }
    

    }

    public class Solution {

    public static List<Pair> quickSort(List<Pair> unsortedList){
        if(unsortedList.size() <= 1)return unsortedList;
        List<Pair> leftList = new ArrayList<Pair>();
        List<Pair> rightList = new ArrayList<Pair>();
        Pair pivot = unsortedList.get(0);
        for(int i = 1; i < unsortedList.size(); i++){
            Pair currentPair = unsortedList.get(i);
            if(currentPair.value.compareTo(pivot.value) > 0)leftList.add(currentPair);
            else rightList.add(currentPair);
        }
        leftList = quickSort(leftList);
        rightList = quickSort(rightList);
        leftList.add(pivot);
        leftList.addAll(rightList);
        return leftList;
    }
    
    public static void main(String[] args) {
        /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();
        List<Pair> inputList = new ArrayList<Pair>();
        for(int i = 0; i < n; i++){
            String inputString = sc.nextLine();
            String valueString = inputString;
            if(inputString.charAt(0) == '.')valueString = "0" + inputString;
            BigDecimal value = new BigDecimal(valueString);
            inputList.add(new Pair(inputString, value));
        }
        sc.close();
        inputList = quickSort(inputList);
        for(Pair e : inputList){
            String outputString = e.input;
            System.out.println(outputString);
        }
    }
    

    }

  • + 1 comment
        s = Arrays.copyOf(s, n);
        Arrays.sort(s, (a, b) -> new BigDecimal(b).compareTo(new BigDecimal(a)));