LeetCode 264

思路：我们根据优先队列的性质，每次出队的元素都是依次增大的只含质因数2，3，5的正整数，我用自己写的小根堆实现的优先

　　　队列，生成丑数的过程请看代码

原题链接：https://leetcode-cn.com/problems/ugly-number-ii/

typedef long long lint;
#define swap(a, b) { \
    __typeof(a) __tmp = a; \
    a = b, b = __tmp; \
}

typedef struct priority_queue {
    lint *data;
    int cnt, size;
} priority_queue;

priority_queue *init(int n) {
    priority_queue *q = (priority_queue *)malloc(sizeof(priority_queue));
    q->data = (lint *)malloc(sizeof(lint) * (n + 1));
    q->cnt = 0, q->size = n;
    return q;
}

int empty(priority_queue *q) {
    return q->cnt == 0;
}

void push(priority_queue *q, lint val) {
    if (q->cnt == q->size) return ;
    q->cnt += 1;
    q->data[q->cnt] = val;
    int ind = q->cnt;
    while (ind >> 1 && q->data[ind] < q->data[ind >> 1]) {
        swap(q->data[ind], q->data[ind >> 1]);
        ind >>= 1;
    }
    return ;
}

void pop(priority_queue *q) {
    if (empty(q)) {
        return ;
    }
    q->data[1] = q->data[q->cnt--];
    int ind = 1;
    while ((ind << 1) <= q->cnt) {
        int l = ind << 1, r = ind << 1 | 1, tmp = ind;
        if (q->data[ind] > q->data[l]) {
            tmp = l;
        }
        if (r <= q->cnt && q->data[tmp] > q->data[r]) {
            tmp = r;
        }
        if (tmp == ind) break;
        swap(q->data[ind], q->data[tmp]);
        ind = tmp;
    }
    return ;
}

int top(priority_queue *q) {
    if (!empty(q)) {
        return q->data[1];
    }
    return -1;
}

int nthUglyNumber(int n) {
    priority_queue *q = init(3 * n);
    lint begin = 1, ans;
    push(q, begin);
    while (n--) {
        ans = top(q);
        pop(q);
        if (ans % 5 == 0) {
            push(q, 5 * ans);
        }
        else if (ans % 3 == 0) {
            push(q, 3 * ans);
            push(q, 5 * ans);
        }
        else {
            push(q, 2 * ans);
            push(q, 3 * ans);
            push(q, 5 * ans);
        }
    }
    return ans;
}