Medium
Optimal Division — C++
Full explanation · Time O(n) · Space O(1)
// Time: O(n)
// Space: O(1)
class Solution {
public:
string optimalDivision(vector<int>& nums) {
if (nums.size() == 1) {
return to_string(nums[0]);
}
if (nums.size() == 2) {
return to_string(nums[0]) + "/" + to_string(nums[1]);
}
string result = to_string(nums[0]) + "/(" + to_string(nums[1]);
for (int i = 2; i < nums.size(); ++i) {
result += "/" + to_string(nums[i]);
}
result.push_back(')');
return result;
}
};