摘要：
直接模拟即可，就是int转string麻烦一点 string countAndSay(int n) { // Note: The Solution object is instantiated only once and is reused by each test case. //just do it straight; string res = "1"; if(n>s; res+=s; res+=prev.substr(j-1,1); ... 阅读全文
摘要：
使用优先级队列struct cmp{ bool operator() ( ListNode* a, ListNode* b ){ return a->val>b->val; }};class Solution {public: ListNode *mergeKLists(vector &lists) { // Note: The Solution object is instaentiated only once and is reused by each test case. int k = lists.size(); ... 阅读全文
摘要：
string longestCommonPrefix(vector &strs) { // Note: The Solution object is instantiated only once and is reused by each test case. if(strs.empty()) return ""; int last = strs[0].size(); for(int i=1;i<strs.size();i++) { last = min(last,(int... 阅读全文
摘要：
void merge(int A[], int m, int B[], int n) { // Note: The Solution object is instantiated only once and is reused by each test case. int i = m-1; int j = n-1; int cur = m+n-1; while(i>=0&&j>=0) { if(A[i]>=B[j]) A[cur--] = A[i--]... 阅读全文