[553. Optimal Division] #leetcode

553_0902.java

class Solution {
  // O(n) O(n)
    public String optimalDivision(int[] nums) {
        StringBuilder sb = new StringBuilder();
        sb.append(nums[0]);
        for (int i = 1; i < nums.length; i++) {
            sb.append("/");
            if (i == 1 && nums.length>2) {
                sb.append("(");
            }
            sb.append(nums[i]);
        }
        return nums.length>2? sb.append(")").toString() : sb.toString();
    }
}