《数据结构与算法分析》习题-----第一章

PS：13题和14题，我将它们综合在一起·····因为我只看了题目对Object、Comparable没有了解（第一章都是一些回顾）·······

//1.5编写一个递归方法，它返回数N二进制表示1的个数。
 #include<iostream>
 using namespace std;
 int ones(int x)
 {
     if(x < 2)
     return x;
     else
     return x % 2 + ones(x / 2);
 }
 
 int oness(int x)
 {
     int n = 0;
     while(x >= 2)
     {
         n += x % 2;
         x /= 2;
     }
     n += x;
     return n;
 }
 
 int main( )
 {
     int X;
     while(cin >> X)
     {
         cout << ones(X) << endl;
         cout << oness(X) << endl;
     }
     return 0;
 }

 

/*1.13 题目：设计一个类模板Collection，来存储Object对象的集合（在一个数组中），以及该集合当前的大小。提供public型的函数isEmpty、makeEmpty、
 insert、remove和contains。当且仅当该集合中存在等于x的一个Object时，contains(x)返回true*/
 /*1.14 题目：设计一个类模板Comparable的对象的集合（在一个数组中），以及该集合当前的大小。提供public型的函数isEmpty、makeEmpty、remove、
 findMin和findMax。findMin和findMax分别返回该集合中的最小和最大的Comparable对象。*/
 #include<iostream>
 #include<cstring>
 using namespace std;
 
 const int M = 1000000;
 
 template <typename T>
 class Collection
 {
 public:
     Collection()
     {
         memset(a, 0, sizeof(a));
         count = 0;
     }
     ~Collection()
     {
         delete [] a;
         count = 0;
     }
     void isEmpty()
     {
         if(count)
             cout << "It is not empty!" << endl;
         else
             cout << "It is empty!" << endl;
     }
     void makeEmpty()
     {
         memset(a, 0, sizeof(a));
         count = 0;
     }
     void insert(const T &x)
     {
         a[count] = x;
         ++count;
     }
     void remove(const T &x)
     {
         int i;
         for(i = 0; i < count; ++i)
         {
             if(a[i] == x)
                 break;
         }
         for(; i <count; ++i)
         {
             a[i] = a[i+1];
         }
         --count;
     }
     bool contains(const T &x)
     {
         int i;
         for(i = 0; i <= count; ++i)
         {
             if(a[i] == x)
                 return true;
         }
         return false;
     }
     void findMin()
     {
         if(count == 0)
         cout << "The collection is empty!" << endl;
         else
         {
             T min = a[0];
             for(int i = 1; i < count; ++i)
             {
                 if(a[i] < min)
                 min = a[i];
             }
             cout << "The minimumest element in the collection is " << min << " !" << endl;
         }
     }
     void findMax()
     {
         if(count == 0)
         cout << "The collection is empty!" << endl;
         else
         {
             T max = a[0];
             for(int i = 1; i < count; ++i)
             {
                 if(a[i] > max)
                 max = a[i];
             }
             cout << "The maximumest element in the collection is " << max << " !" << endl;
          }
     }
 private:
     T a[10000];
     int count;
 };
 
 int main()
 {
     Collection<int> p;
     int N, i, m;
     while(cin >> N)
     {
         p.isEmpty();
         for(i = 1; i <= N; ++i)
         {
             cin >> m;
             p.insert(m);
         }
         p.isEmpty();
         p.findMin();
         p.findMax();
         cout << "Input the  element you want to find:" << endl;
         cin >> m;
         if(p.contains(m))
         {
             cout << "The element exist in the collection!" << endl;
         }
         else
             cout << "The element does not exist in the collection!" << endl;
         cout << "Input the element you want to remove:" << endl;
         cin >> m;
         if(p.contains(m))
         {
             p.remove(m);
             if(p.contains(m))
                 cout << "The element remove unsuccessfully!" << endl;
             else
                 cout << "The element remove successfully!" << endl;
         }
         else
         cout << "The element does not exist in the collection!" << endl;
         cout << "Make the collection empty!" << endl;
         p.makeEmpty();
         p.isEmpty();
     }
     return 0;
 }