LeetCode-Answer/1356.根据数字二进制下-1-的数目排序.c at master · zhangjunxiongjie/LeetCode-Answer · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/*
 * @lc app=leetcode.cn id=1356 lang=c
 *
 * [1356] 根据数字二进制下 1 的数目排序
 */

// @lc code=start


/**
 * Note: The returned array must be malloced, assume caller calls free().
 */
int* sortByBits(int* arr, int arrSize, int* returnSize){

    int *arrAssistant = malloc(sizeof(int) * arrSize);

    for (int *arrPointer = arr, *arrAssistantPointer = arrAssistant; arrPointer < (arr + arrSize); arrPointer++, arrAssistantPointer++) {

        int middle = (*arrPointer);
        int middleCounter = 0;
        while (middle) {

            if (middle & 1) {
                middleCounter++;
            }
            middle >>= 1;
        }

        (*arrAssistantPointer) = middleCounter;
        // printf ("%d, ", (*arrAssistantPointer));
    }

    for (int i = 0; i < arrSize; i++) {

        int target = i;
        for (int j = (target + 1); j < arrSize; j++) {

            if (arrAssistant[target] > arrAssistant[j]) {

                target = j;
            }
            else if ((arrAssistant[target] == arrAssistant[j]) && (arr[target] > arr[j])) {

                target = j;
            }
        }

        if (target != i) {

            arr[target] ^= arr[i];
            arr[i] ^= arr[target];
            arr[target] ^= arr[i];

            arrAssistant[target] ^= arrAssistant[i];
            arrAssistant[i] ^= arrAssistant[target];
            arrAssistant[target] ^= arrAssistant[i];
        }
    }

    free(arrAssistant);

    (*returnSize) = arrSize;
    return arr;
}

// @lc code=end