zizahn的博客

#includeusing namespace std;typedef struct node{ int data; struct node *next;}Lnode;//头插法Lnode*creat1(){ Lnode*h,*p; h=(Lnode*)malloc(sizeof(Lnode)); h->next=NULL; int n; while(cin>>n&&n)

#include#define maxsize 10using namespace std;typedef struct{ int v[maxsize]; int len;}sqlist;int insert(sqlist*L,int i,int elem){ if(L->len==maxsize){cout<<"溢出"<<endl;return 0;} else if(ima

#includeusing namespace std;typedef struct node{ int data; struct node *next;}Lnode;Lnode*create(){ Lnode*h,*p,*t; h=(Lnode*)malloc(sizeof(Lnode)); h->next=NULL; int n; t=h; while(cin>>n

关键是确定a[i]是否比后面的元素都大来判断它是否被打印。这里采用另外一个从大到小的数组，a[i]与之比较，如果相等则打印a[i]因为已经确保a[i]此时已是数组中最大的元素，否则进入队列末尾#include#include#includeusing namespace std;#define maxsize 150int a[maxsize];bool cmp(int x,int y){ return x>y;}struct point{ int x,y;}p[150];

#include#includeusing namespace std;struct Node{ int w,h;};int main(){ int n; while(cin>>n&&n!=-1) { stacks; Node* rect=new Node[n+2]; int i; int total_w,cur_area,max_area=0; for(

#includeusing namespace std;struct Child{ int no; Child *next;};class Joseph{ int n,m; Child *h;public: Joseph(int a,int b):n(a),m(b){} ~Joseph(){} void Create(); void seq();};void Jo

#includeusing namespace std;struct PolyNode{ double coef; int exp; PolyNode *next;};class PolyClass{ PolyNode *head;//单链表的头结点指针public: PolyClass(); ~PolyClass(); void Disp(); void Creat

//stl中的list就是一个双向链表，可以高效的进行插入删除元素，但不支持随机访问#include#includeusing namespace std;list list1,list2,list3;void Init(){ list1.push_back(1); list1.push_back(2); list1.push_back(3); list1.push_bac