1
class Solution {
2
  public String optimalDivision(int[] nums) {
3

4
    if (nums.length == 1) {
5
      return nums[0] + "";
6
    } else if (nums.length == 2) {
7
      StringBuilder sb = new StringBuilder();
8
      sb.append(nums[0] + "/" + nums[1]);
9
      return sb.toString();
10
    }
11

12
    StringBuilder sb = new StringBuilder();
13
    sb.append(nums[0]);
14
    sb.append("/(");
15
    for (int i = 1; i < nums.length - 1; i++) {
16
      sb.append(nums[i] + "/");
17
    }
18
    sb.append(nums[nums.length - 1] + ")");
19

20
    return sb.toString();
21
  }
22
}