leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0553.cpp (436B)

0 class Solution { 1 public: 2 string optimalDivision(const vector<int> &nums) { 3 const int n = nums.size(); 4 if (n == 1) return to_string(nums[0]); 5 if (n == 2) return to_string(nums[0]) + "/" + to_string(nums[1]); 6 string res = to_string(nums[0]) + "/(" + to_string(nums[1]); 7 for (int i = 2; i < n; i++) 8 res += "/" + to_string(nums[i]); 9 res += ')'; 10 return res; 11 } 12 };