Efficient Java Soln (no sort)
first while loop:\n\tdetract from max number each pass \nsecond while loop:\n\tfinish remainder if not already finished\n\n\npublic int fillCups(int[] amount) {
first while loop:\n\tdetract from max number each pass \nsecond while loop:\n\tfinish remainder if not already finished\n\n```\npublic int fillCups(int[] amount) {\n        int count = 0;\n        while(amount[0] > 0)\n        {\n            amount[0] -= 1;\n            if(amount[1] < amount[2])\n                amount[2] -= 1;\n            else\n                amount[1] -= 1;\n            \n            count++;\n        }\n        while(amount[1] > 0 || amount[2] > 0)\n        {\n            amount[1] -= 1;\n            amount[2] -= 1;\n            count++;\n        }\n\n        return count;\n    }\n```\n\n
['Java']