Equal Stacks - Hackerrank

https://www.hackerrank.com/challenges/equal-stacks

You have three stacks of cylinders where each cylinder has the same diameter, but they may vary in height. You can change the height of a stack by removing and discarding its topmost cylinder any number of times.

Find the maximum possible height of the stacks such that all of the stacks are exactly the same height. This means you must remove zero or more cylinders from the top of zero or more of the three stacks until they're all the same height, then print the height. The removals must be performed in such a way as to maximize the height.

Note: An empty stack is still a stack.

Input Format

The first line contains three space-separated integers, , , and , describing the respective number of cylinders in stacks , , and . The subsequent lines describe the respective heights of each cylinder in a stack from top to bottom:

• The second line contains  space-separated integers describing the cylinder heights in stack .
• The third line contains  space-separated integers describing the cylinder heights in stack .
• The fourth line contains  space-separated integers describing the cylinder heights in stack .

Constraints

Output Format

Print a single integer denoting the maximum height at which all stacks will be of equal height.

Sample Input

5 3 4
3 2 1 1 1
4 3 2
1 1 4 1

Sample Output

5

Explanation

Initially, the stacks look like this:

Observe that the three stacks are not all the same height. To make all stacks of equal height, we remove the first cylinder from stacks  and , and then remove the top two cylinders from stack  (shown below).

As a result, the stacks undergo the following change in height:

All three stacks now have . Thus, we print  as our answer.

https://github.com/charles-wangkai/hackerrank/blob/master/equal-stacks/Solution.java
https://github.com/charles-wangkai/hackerrank/blob/master/equal-stacks/Solution.java
Deque<Integer>[] stacks = new Deque[3];
int[] totalHeights = new int[3];
for (int i = 0; i < stacks.length; i++) {
  stacks[i] = new LinkedList<Integer>();

  for (int j = 0; j < n[i]; j++) {
    int height = sc.nextInt();
    stacks[i].add(height);
    totalHeights[i] += height;
  }
}

while (!(totalHeights[0] == totalHeights[1] && totalHeights[1] == totalHeights[2])) {
  int maxTotalHeightIndex = 0;
  for (int i = 1; i < totalHeights.length; i++) {
    if (totalHeights[i] > totalHeights[maxTotalHeightIndex]) {
      maxTotalHeightIndex = i;
    }
  }

  totalHeights[maxTotalHeightIndex] -= stacks[maxTotalHeightIndex].pollFirst();
}
System.out.println(totalHeights[0]);
http://www.allprogrammingtutorials.com/tutorials/equal-stacks-challenge.php
/** * Returns minumum height across all the input stack heights. * * @param heights Array containing the height of stacks. * @return minimum height. */ private static int minStackHeight(int[] heights) { int maxHeight = Integer.MAX_VALUE; for(int i = 0; i < heights.length; i++) { maxHeight = Math.min(maxHeight, heights[i]); } return maxHeight; } /** * @param heights Array containing the height of stacks. * @return true if all the elements of input array are equal. */ private static boolean areAllElementsEqual(int[] heights) { int height = heights[0]; for(int hTmp : heights) { if(height != hTmp) { return false; } } return true; } public static void main(String[] args) { final Scanner in = new Scanner(System.in); int n1 = in.nextInt(); int n2 = in.nextInt(); int n3 = in.nextInt(); final int[][] stacks = {new int[n1], new int[n2], new int[n3]}; final int[] heights = {0, 0, 0}; final int[] indexes = {0, 0 ,0}; for(int i = 0; i < stacks.length; i++) { for(int j = 0; j < stacks[i].length; j++) { stacks[i][j] = in.nextInt(); heights[i] += stacks[i][j]; } } int minHeight = minStackHeight(heights); while(!areAllElementsEqual(heights)) { for(int i = 0; i < stacks.length; i++) { if(heights[i] > minHeight) { heights[i] -= stacks[i][indexes[i]++]; minHeight = Math.min(minHeight, heights[i]); } } } System.out.println(minHeight); in.close(); }