delect executable files

Author: Hawstein

1.1

@@ -4,7 +4,7 @@ using namespace std;
 class Bitmap{
 public:
     Bitmap(int size = 32){
-        bits = new int[size/32];
+        bits = new int[size/32 + 1];
     }
     ~Bitmap(){
         delete[] bits;

1.2

@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+
+class FirstClass {
+public:
+    virtual void MethodA(int) {
+        cout<<"FirstClass::MethodA(int)"<<endl;
+    }
+    virtual void MethodA(int, int) {
+        cout<<"FirstClass::MethodA(int,int)"<<endl;
+    }
+};
+
+class SecondClass: public FirstClass {
+public:
+    void MethodA1(int, int, int) {
+        cout<<"SecondClass::MethodA(int)"<<endl;
+    }
+};
+
+int main() {
+    SecondClass sc;
+    sc.MethodA(0, 0);    
+    return 0;
+}

1.3

@@ -27,12 +27,12 @@ node* init(int a[], int n, int m){
 node* loopstart(node *head){
     if(head==NULL) return NULL;
     node *fast = head, *slow = head;
-    while(fast->next!=NULL){
+    while(fast && fast->next){
         fast = fast->next->next;
         slow = slow->next;
         if(fast==slow) break;
     }
-    if(fast->next==NULL) return NULL;
+    if(!fast || !fast->next) return NULL;
     slow = head;
     while(fast!=slow){
         fast = fast->next;

1.4

@@ -17,8 +17,10 @@ class Median{
 void Median::Insert(int v){
     if(max_heap.empty() && min_heap.empty())
         max_heap.push(v);
+    // max_heap不为空，则往max_heap插入数据，
+    // 往min_heap插入数据的话可能导致较小的数放到右边的堆
     else if(!max_heap.empty() && min_heap.empty())
-        max_heap.push(v);
+        max_heap.push(v); 
     else if(max_heap.empty() && !min_heap.empty())
         min_heap.push(v);
     else{
@@ -57,16 +59,19 @@ int Median::GetValue(){//中位数为int，由于有除法，也可改为float
 int main(){
     srand((unsigned)time(0));
     Median md;
-    vector<int> vi;
-    int num = rand() % 30; //数量是30以内的随机数
-    for(int i=0; i<num; ++i){
-        int data = rand() % 100; //元素是100内的数
-        vi.push_back(data);
-        md.Insert(data);
-    }
-    sort(vi.begin(), vi.end());
-    for(int i=0; i<num; ++i)
-        cout<<vi.at(i)<<" "; //排序的序列
+    // vector<int> vi;
+    // int num = rand() % 30; //数量是30以内的随机数
+    // for(int i=0; i<num; ++i){
+    //     int data = rand() % 100; //元素是100内的数
+    //     vi.push_back(data);
+    //     md.Insert(data);
+    // }
+    // sort(vi.begin(), vi.end());
+    // for(int i=0; i<num; ++i)
+    //     cout<<vi.at(i)<<" "; //排序的序列
+    md.Insert(3);
+    md.Insert(1);
+    md.Insert(2);
     cout<<endl<<md.GetValue()<<endl; //中位数
     return 0;
 }

1.5

@@ -4,10 +4,12 @@ using namespace std;
 
 void print_binary(int n){
     vector<int> v;
-    while(n != 0){
-        if(n&1) v.push_back(1);
+    int len = 8 * sizeof(int);
+    int mask = 1;
+    while(len--){
+        if(n&mask) v.push_back(1);
         else v.push_back(0);
-        n >>= 1;
+        mask <<= 1;
     }
     while(!v.empty()){
         cout<<v.back();

1.6

@@ -21,15 +21,15 @@ int next(int x){
     int max_int = ~(1<<31);
     int num = count_one(x);
     if(num == 0 || x == -1) return -1;
-    for(++x; count_one(x) != num && x <= max_int; ++x);
+    for(++x; count_one(x) != num && x < max_int; ++x);
     if(count_one(x) == num) return x;
     return -1;
 }
 int previous(int x){
     int min_int = (1<<31);
     int num = count_one(x);
     if(num == 0 || x == -1) return -1;
-    for(--x; count_one(x) != num && x >= min_int; --x);
+    for(--x; count_one(x) != num && x > min_int; --x);
     if(count_one(x) == num) return x;
     return -1;
 }
@@ -57,11 +57,12 @@ int previous1(int x){
     int num1 = count_one(xx) - count_one(x);
     x >>= bit;
     for(; num1 > 0; x = (x<<1) | 1, --num1, --bit);
-    for(; bit > 0; x <<= 1, --bit);
+    //for(; bit > 0; x <<= 1, --bit);
+    x <<= bit;
     return x;
 }
 int main(){
-    int a = -976756;//(1<<31)+(1<<29);//-8737776;
+    int a = -9756;//(1<<31)+(1<<29);//-8737776;
     cout<<next(a)<<" "<<previous(a)<<endl;
     cout<<next1(a)<<" "<<previous1(a)<<endl;;
     return 0;

1.7

@@ -19,6 +19,7 @@ int missing(int a[], int n){
     for(int i=0; i<n+1; ++i){
         if(!b[i]) return i;
     }
+    delete[] b;
 }
 int fetch1(int a[], int j){
     return (a[j/32] >> (j % 32)) & 1;

1.8

@@ -3,27 +3,19 @@ using namespace std;
 
 int search(int a[], int low, int high, int x){
     while(low <= high){
-        //cout<<low<<" "<<high<<endl;
-        //++cnt;
-        int mid = (low+high)>>1;
+        int mid = low + (high - low)/2;
         if(a[mid] == x) return mid;
-        if(a[mid] < x){
-            if(a[mid] < a[low]){
-                if(a[low] <= x) high = mid - 1;
-                else low = mid + 1;
-            }
-            else{
+        if(a[mid] >= a[low]) {
+            if(x<a[mid] && x>=a[low])
+                high = mid - 1;
+            else
                 low = mid + 1;
-            }
         }
-        else{
-            if(a[mid] < a[low]){
+        else {
+            if(x>a[mid] && x<a[low])
+                low = mid + 1;
+            else
                 high = mid - 1;
-            }
-            else{
-                if(a[low] <= x) high = mid - 1;
-                else low = mid + 1;
-            }
         }
     }
     return -1;
@@ -36,5 +28,6 @@ int main(){
         2,2,2,2,2,2,2,2,3,2,2,2,2,2,2,2,2,2,2
     };
     cout<<search(a, 0, 11, 3)<<endl;
+    cout<<search(b, 0, 18, 3)<<endl;
     return 0;
 }

10.4

@@ -18,7 +18,7 @@ int lis(person p[], int n){
     int k = 1;
     d[0] = p[0].w;
     for(int i=1; i<n; ++i){
-        if(p[i].w >= d[k-1]) d[k++] = p[i].w;
+        if(p[i].w > d[k-1]) d[k++] = p[i].w;
         else{
             int j;
             for(j=k-1; j>=0 && d[j]>p[i].w; --j);//用二分可将复杂度降到O(nlogn)
@@ -27,6 +27,18 @@ int lis(person p[], int n){
     }
     return k;
 }
+int lis1(person p[], int n) {
+    int k = 1;
+    person d[n];
+    d[0] = p[0];
+    for(int i=1; i<n; ++i) {
+        if(p[i].w>d[k-1].w && p[i].h>d[k-1].h) d[k++] = p[i];
+        else {
+            int j;
+            for(j=k-1; j>=0 && (p[i].w<))
+        }
+    }
+}
 int main(){
     freopen("9.7.in", "r", stdin);
     int n;

10.6

@@ -3,5 +3,5 @@
 70 150
 56 90
 75 190
-60 95
+56 95
 68 110