Minimum Sum of Four Digit Number After Splitting Digits LeetCode solution in C++

1
class Solution {
2
public:
3
int minimumSum(int num) {
4
string s = to_string(num);
5
sort(s.begin(), s.end());
6
int res = (s[0] - '0' + s[1] - '0') * 10 + s[2] - '0' + s[3] - '0';
7
return res;
8
}
9
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0