solution/2100-2199/2160.Minimum Sum of Four Digit Number After Splitting Digits/Solution.c at main

main

leetcode-erlang

325 issues
2 pull requests
5,000 files
1 active branch

List view

solution\2100-2199\2160.Minimum Sum of Four Digit Number After Splitting Digits\Solution.c

3 Complexity
1.5 Complexity / M
0 Duplication
1 Churn
13 Lines
12 Lines of Code
2 Methods
6 LOC / Method

int cmp(const void* a, const void* b) {
    return *(int*) a - *(int*) b;
}

int minimumSum(int num) {
    int nums[4] = {0};
    for (int i = 0; i < 4; i++) {
        nums[i] = num % 10;
        num /= 10;
    }
    qsort(nums, 4, sizeof(int), cmp);
    return 10 * (nums[0] + nums[1]) + nums[2] + nums[3];
}