package leetcode;

/**
 * https://leetcode.com/problems/longest-happy-string/
 */
public class Problem1405 {
    public String longestDiverseString(int a, int b, int c) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem1405 prob = new Problem1405();
        System.out.println(prob.longestDiverseString(1, 1, 7)); // "ccaccbcc"
        System.out.println(prob.longestDiverseString(1, 1, 10)); // "ccaccbcc"
        System.out.println(prob.longestDiverseString(2, 2, 1)); // "aabbc"
        System.out.println(prob.longestDiverseString(7, 1, 0)); // "aabaa"
    }
}

package leetcode;

/**
 * https://leetcode.com/problems/longest-happy-string/
 */
public class Problem1405 {
    public String longestDiverseString(int a, int b, int c) {
        // TODO
        return null;
    }

    public static void main(String[] args) {
        Problem1405 prob = new Problem1405();
        System.out.println(prob.longestDiverseString(1, 1, 7)); // "ccaccbcc"
        System.out.println(prob.longestDiverseString(1, 1, 10)); // "ccaccbcc"
        System.out.println(prob.longestDiverseString(2, 2, 1)); // "aabbc"
        System.out.println(prob.longestDiverseString(7, 1, 0)); // "aabaa"
        System.out.println(prob.longestDiverseString(5, 6, 7)); // "ccbbaaccbbaaccbbac"
    }
}

Update problem 1405