摘要:
class Solution {public: int nthUglyNumber(int n) { if(n k(n); k[0] = 1; for(int i = 1; i =1 阅读全文
摘要:
https://leetcode.com/problems/h-index/class Solution {public: int hIndex(vector& citations) { priority_queue pq; for(int i=0;i= pages... 阅读全文