| ! | Java Pure Brute Force Solution | ! |
class Solution {\n    public int fillCups(int[] amount) {\n        int countSec=0;\n        while(true){\n         Arrays.sort(amount);\n         if(amount[0]==
class Solution {\n    public int fillCups(int[] amount) {\n        int countSec=0;\n        while(true){\n         Arrays.sort(amount);\n         if(amount[0]==0&&amount[1]==0&&amount[2]==0){\n             break;\n         }\n         ++countSec;  \n            if(amount[1]>0)\n            {\n                amount[1]--;\n            }\n            if(amount[2]>0){\n                amount[2]--;\n            }\n     }   \n        return countSec;\n    }\n}
[]