摘要：class Solution {public: int Add(int num1, int num2) { while(num2!=0) { int tmp=num1^num2;//得到相加以后没有进位的数 num2=(num1&num2)<<1;//进位 num1=tmp; } return nu 阅读全文

摘要：#include<iostream> using namespace std;template<class T>class SqQueue{　protected: int front,rear; int maxSize; T *elem;　public: SqQueue(int size); ~Sq 阅读全文

摘要：#include<iostream> template<class T>struct Node{ T data; Node<T> *next;};template<class T>class Queue{private: Node<T> *front, *rear;public: Queue(); 阅读全文

摘要：#include<iostream> using namespace std;template <class T>struct Node{ T data; Node<T> *next;};template <class T>class List{public: List(int len); ~Lis 阅读全文