gif捕捉制作工具： Demo ends:1034044285 名字:kukuasir 注冊碼:這里輸入新注冊碼 錄制區(qū)域:0,0 1024x738 幀的延時(shí):500 幀間透明:是 記錄時(shí)間信息:是 循環(huán):是 屏幕仿真:是 覆蓋邊緣:是 覆蓋指針:是 Explorer 2.0 兼容:否 錄制尺寸:100
標(biāo)簽： gif捕捉制作
上傳時(shí)間： 2015-10-19
上傳用戶：dumpsoft
#include <iostream> #include <stdio.head> #include <stdlib.head> #include <string.head> #define ElemType int #define max 100 using namespace std; typedef struct node1 { ElemType data; struct node1 *next; }Node1,*LinkList;//鏈棧 typedef struct { ElemType *base; int top; }SqStack;//順序棧 typedef struct node2 { ElemType data; struct node2 *next; }Node2,*LinkQueue; typedef struct node22 { LinkQueue front; LinkQueue rear; }*LinkList;//鏈隊(duì)列 typedef struct { ElemType *base; int front,rear; }SqQueue;//順序隊(duì)列 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 //1．采用鏈?zhǔn)酱鎯?chǔ)實(shí)現(xiàn)棧的初始化、入棧、出棧操作。 LinkList CreateStack()//創(chuàng)建棧 { LinkList top; top=NULL; return top; } bool StackEmpty(LinkList s)//判斷棧是否為空，0代表空 { if(s==NULL) return 0; else return 1; } LinkList Pushead(LinkList s,int x)//入棧 { LinkList q,top=s; q=(LinkList)malloc(sizeof(Node1)); q->data=x; q->next=top; top=q; return top; } LinkList Pop(LinkList s,int &e)//出棧 { if(!StackEmpty(s)) { printf("棧為空。"); } else { e=s->data; LinkList p=s; s=s->next; free(p); } return s; } void DisplayStack(LinkList s)//遍歷輸出棧中元素 { if(!StackEmpty(s)) printf("棧為空。"); else { wheadile(s!=NULL) { cout<<s->data<<" "; s=s->next; } cout<<endl; } } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 //2．采用順序存儲(chǔ)實(shí)現(xiàn)棧的初始化、入棧、出棧操作。 int StackEmpty(int t)//判斷棧S是否為空 { SqStack.top=t; if (SqStack.top==0) return 0; else return 1; } int InitStack() { SqStack.top=0; return SqStack.top; } int pushead(int t,int e) { SqStack.top=t; SqStack.base[++SqStack.top]=e; return SqStack.top; } int pop(int t,int *e)//出棧 { SqStack.top=t; if(!StackEmpty(SqStack.top)) { printf("棧為空."); return SqStack.top; } *e=SqStack.base[s.top]; SqStack.top--; return SqStack.top; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 //3．采用鏈?zhǔn)酱鎯?chǔ)實(shí)現(xiàn)隊(duì)列的初始化、入隊(duì)、出隊(duì)操作。 LinkList InitQueue()//創(chuàng)建 { LinkList head; head->rear=(LinkQueue)malloc(sizeof(Node)); head->front=head->rear; head->front->next=NULL; return head; } void deleteEle(LinkList head,int &e)//出隊(duì) { LinkQueue p; p=head->front->next; e=p->data; head->front->next=p->next; if(head->rear==p) head->rear=head->front; free(p); } void EnQueue(LinkList head,int e)//入隊(duì) { LinkQueue p=(LinkQueue)malloc(sizeof(Node)); p->data=e; p->next=NULL; head->rear->next=p; head->rear=p; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 //4．采用順序存儲(chǔ)實(shí)現(xiàn)循環(huán)隊(duì)列的初始化、入隊(duì)、出隊(duì)操作。 bool InitQueue(SqQueue &head)//創(chuàng)建隊(duì)列 { head.data=(int *)malloc(sizeof(int)); head.front=head.rear=0; return 1; } bool EnQueue(SqQueue &head,int e)//入隊(duì) { if((head.rear+1)%MAXQSIZE==head.front) { printf("隊(duì)列已滿\n"); return 0; } head.data[head.rear]=e; head.rear=(head.rear+1)%MAXQSIZE; return 1; } int QueueLengthead(SqQueue &head)//返回隊(duì)列長度 { return (head.rear-head.front+MAXQSIZE)%MAXQSIZE; } bool deleteEle(SqQueue &head,int &e)//出隊(duì) { if(head.front==head.rear) { cout<<"隊(duì)列為空！"<<endl; return 0; } e=head.data[head.front]; head.front=(head.front+1)%MAXQSIZE; return 1; } int gethead(SqQueue head)//得到隊(duì)列頭元素 { return head.data[head.front]; } int QueueEmpty(SqQueue head)//判斷隊(duì)列是否為空 { if (head.front==head.rear) return 1; else return 0; } void travelQueue(SqQueue head)//遍歷輸出 { wheadile(head.front!=head.rear) { printf("%d ",head.data[head.front]); head.front=(head.front+1)%MAXQSIZE; } cout<<endl; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 //5．在主函數(shù)中設(shè)計(jì)一個(gè)簡單的菜單，分別測試上述算法。 int main() { LinkList top=CreateStack(); int x; wheadile(scanf("%d",&x)!=-1) { top=Pushead(top,x); } int e; wheadile(StackEmpty(top)) { top=Pop(top,e); printf("%d ",e); }//以上是鏈棧的測試 int top=InitStack(); int x; wheadile(cin>>x) top=pushead(top,x); int e; wheadile(StackEmpty(top)) { top=pop(top,&e); printf("%d ",e); }//以上是順序棧的測試 LinkList Q; Q=InitQueue(); int x; wheadile(scanf("%d",&x)!=-1) { EnQueue(Q,x); } int e; wheadile(Q) { deleteEle(Q,e); printf("%d ",e); }//以上是鏈隊(duì)列的測試 SqQueue Q1; InitQueue(Q1); int x; wheadile(scanf("%d",&x)!=-1) { EnQueue(Q1,x); } int e; wheadile(QueueEmpty(Q1)) { deleteEle(Q1,e); printf("%d ",e); } return 0; }
標(biāo)簽： 數(shù)據(jù)結(jié)構(gòu) 實(shí)驗(yàn)
上傳時(shí)間： 2018-05-09
上傳用戶：123456..
參照棧類模板的例子編寫一個(gè)隊(duì)列類模板class <T> Queue，私有成員包括：隊(duì)首指針Front，隊(duì)尾指針Tail，隊(duì)列容積max。實(shí)現(xiàn)：構(gòu)造函數(shù)Queue，復(fù)制構(gòu)造函數(shù)Queue，析構(gòu)函數(shù)~Queue，入隊(duì)函數(shù)In，出隊(duì)函數(shù)Out（每次出隊(duì)，后面的元素自動(dòng)前移一位），判隊(duì)列空函數(shù)Empty。并分別用隊(duì)列類模板定義int和double對象，通過實(shí)例調(diào)用各個(gè)成員函數(shù)。
標(biāo)簽： Queue 函數(shù) double class Front Empty 隊(duì)列 Tail 模板 Out
上傳時(shí)間： 2020-05-04
上傳用戶：1qw2e3r4t5y6u7i8
This book gives a comprehensive overview of the technologies for the advances of mobile radio access networks. The topics covered include linear transmitters, superconducting filters and cryogenic radio frequency (RF) front head, radio over fiber, software radio base stations, mobile terminal positioning, high speed downlink packet access (HSDPA), multiple antenna systems such as smart antennas and multiple input and multiple output (MIMO) systems, orthogonal frequency division multiplexing (OFDM) systems, IP-based radio access networks (RAN), autonomic networks, and ubiquitous networks.
標(biāo)簽： Advances Networks Access Mobile Radio in
上傳時(shí)間： 2020-05-26
上傳用戶：shancjb
OSCILLATORS are key building blocks in integrated transceivers. In wired and wireless communication terminals, the receiver front-end selects, amplifies and converts the desired high-frequency signal to baseband. At baseband the signal can then be converted into the digital domain for further data processing and demodula- tion. The transmitter front-end converts an analog baseband signal to a suitable high- frequency signal that can be transmitted over the wired or wireless channel.
標(biāo)簽： High-Frequency Oscillator Design
上傳時(shí)間： 2020-05-27
上傳用戶：shancjb
This book presents millimeter wave communication system design and analysis at the level to produce an understanding of the interaction between a wireless system and its front end so that the overall performance can be predicted. Gigabit wireless commu- nications require a considerable amount of bandwidth, which can be supported by millimeter waves. Millimeter wave technology has come of age, and at the time of writing the standards of IEEE 802.15.3c, WiGig, Wireless HD TM , and the European Computer Manufacturers Association have recently been finalized.
標(biāo)簽： Communication Millimeter Systems Wave
上傳時(shí)間： 2020-05-28
上傳用戶：shancjb
Use of multiple antennas at both ends of wireless links is the result of the natural progression of more than four decades of evolution of adaptive antenna technology. Recent advances have demonstrated that multiple- input-multiple-output (MIMO) wireless systems can achieve impressive increases in overall system performance.
標(biāo)簽： Technology System MIMO
上傳時(shí)間： 2020-05-28
上傳用戶：shancjb
The first practical examples of mobile communications were used in many countries like the USA, the UK and Germany in military services, and played a significant role in the First World War to transfer important information from the front to headquarters to take further actions. Good and secure wireless communications were an important need for all military services – army, navy and air force. In this respect, the Second World War was a big experimental battlefield for the development and evolution of mobile radio. It was in the interests of governments that after the Second World War the military investment should be paid back by civilian use, and all western European countries started their so-called first generation of mobile communication networks.
標(biāo)簽： Multimedia Business Mobile The
上傳時(shí)間： 2020-06-01
上傳用戶：shancjb
Wirelesscommunications,especiallyinitsmobileform,hasbroughtusthefreedomofmobility andhaschangedthelifestylesofmodernpeople.Waitingatafixedlocationtoreceiveormakea phone call, or sitting in front of a personal computer to send an e-mail or download a video program, has become an old story. Nowadays it is commonplace for people to talk over a cell phonewhilewalkingonthestreet,ortodownloadandwatchamoviewhiletravelingonatrain. Thisisthebenefitmadeavailabletousbythesuccessfulevolutionofwirelesscommunications over three generations, with the fourth generation being under way.
標(biāo)簽： Communications Management Wireless Resource
上傳時(shí)間： 2020-06-01
上傳用戶：shancjb
TI高速AD采樣系統(tǒng)設(shè)計(jì)原理圖 DC 2G
標(biāo)簽： 采樣系統(tǒng)
上傳時(shí)間： 2021-10-30
上傳用戶：
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
<li id="w8woq"></li>