MCPcopy Create free account
hub / github.com/Rohit91singh9/Coding-DP-DSA / getMinimumTrips

Method getMinimumTrips

MinimumTrips.java:3–31  ·  view source on GitHub ↗
(List<Integer> weights)

Source from the content-addressed store, hash-verified

1// Approach 1
2
3 public static int getMinimumTrips(List<Integer> weights)
4 {
5 int size = weights.size();
6 int minTrips = 0;
7 Map<Integer, Integer> freq = new HashMap<>();
8 for (int i : weights)
9 {
10 freq.put(i, freq.getOrDefault(i, 0) + 1);
11 }
12 for (Map.Entry<Integer, Integer> elem : freq.entrySet())
13 {
14 int i = elem.getValue();
15 if (i == 1)
16 return -1;
17 if (i % 3 == 0)
18 {
19 minTrips += i / 3;
20 }
21 else if (i % 3 == 2)
22 {
23 minTrips += (i - 2) / 3 + 1;
24 }
25 else
26 {
27 minTrips += (i - 1) / 3 + 1;
28 }
29 }
30 return minTrips;
31 }
32}
33// please define the main method
34

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected