package leetcode;

/**
 * https://leetcode.com/problems/maximum-score-from-removing-stones/
 */
public class Problem1753 {
    public int maximumScore(int a, int b, int c) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem1753 prob = new Problem1753();
        System.out.println(prob.maximumScore(2, 4, 6)); // 6
        System.out.println(prob.maximumScore(4, 4, 6)); // 7
        System.out.println(prob.maximumScore(1, 8, 8)); // 8
    }
}

@@ -12,16 +12,42 @@
 tcode;%0A%0A
+import java.util.Arrays;%0A%0A
 /**%0A * h
@@ -205,314 +205,525 @@
     
-// TODO%0A        return 0
+int answer = 0;%0A        int%5B%5D array = new int%5B%5D%7Ba, b, c%7D
 ;%0A    
-%7D%0A%0A
     
-public static void main(String%5B%5D args) %7B%0A        Problem1753 prob = new Problem1753();%0A        System.out.println(prob.maximumScore(2, 4, 6)); // 6%0A        System.out.println(prob.maximumScore(4, 4, 6)); // 7%0A        System.out.println(prob.maximumScore(1, 8, 8)); // 8
+while (true) %7B%0A            // Find two maximum values in the array, but I'm lazy and the array has a%0A            // fixed size, which is 3.%0A            Arrays.sort(array);%0A            array%5B1%5D--;%0A            array%5B2%5D--;%0A            answer++;%0A            if ((array%5B0%5D %3C= 0 && array%5B1%5D %3C= 0) %7C%7C (array%5B0%5D %3C= 0 && array%5B2%5D %3C= 0) %7C%7C%0A                (array%5B1%5D %3C= 0 && array%5B2%5D %3C= 0)) %7B%0A                break;%0A            %7D%0A        %7D%0A        return answer;
 %0A   

Solve problem 1753