We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Hash Tables: Ice Cream Parlor
  2. Discussions

Hash Tables: Ice Cream Parlor

  • woldegebrielkeb1
     + 3 comments

    here is my java solution. short and sweet. 

     static void whatFlavors(int[] cost, int money) {
        Map<Integer,Integer> map = new HashMap<>();
        map.put(money-cost[0],1);
        for(int i=1; i<cost.length; i++) {
            if(map.containsKey(cost[i])) {
                System.out.println(map.get(cost[i])+" "+(i+1));
                break;
            }
            else if(!map.containsKey(cost[i])&&money-cost[i]>0) {
                map.put(money-cost[i], i+1);
            }
        }

    }