摘要:
出错代码 class Solution { public: int math(int n) { int ans = 0; while (n) { n &= (n - 1); ans++; } return ans; } bool cmp(int x, int y) { if (math(x) == 阅读全文
摘要:
建立一个小根堆,并插入 #include<bits/stdc++.h> using namespace std; int Size=10000; void Siftup(int *arr,int start) { int j = start; int i = (j - 1)/2; //i是j的双亲 阅读全文
摘要:
A strange lift Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description There is a strange lift.The lift c 阅读全文