探討電容可以使用的壽命，以便cost down
标签： 電容元件
上传时间： 2015-06-28
上传用户：任金霞2018
shell script面试问题， Top 50 Shell Scripting Interview Questions
标签： shell script面试问题
上传时间： 2015-11-08
上传用户：1罗志权
这是华为内部的优秀C项目，供大家学习参考。 body {background: #383838 !important;}::-webkit-scrollbar{height:10px !important; width:10px !important; overflow:visible !important;}::-webkit-scrollbar-button{height:0 !important; width:0 !important; display:none !important;}::-webkit-scrollbar-track{box-shadow:none !important;}::-webkit-scrollbar-track:hover{background-color:rgba(56, 56, 56, 0.03) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-track:active{background-color:rgba(56, 56, 56, 0.04) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.14), inset -1px -1px 0 rgba(56, 56, 56, 0.14) !important;}::-webkit-scrollbar-thumb{background-clip:padding-box !important; background-color:rgba(56, 56, 56, 0.2) !important;}::-webkit-scrollbar-thumb:vertical{min-height:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:horizontal{min-width:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:hover{background-color:rgba(56, 56, 56, 0.6) !important; box-shadow:inset 1px 1px 1px rgba(56, 56, 56, 0.25), inset -1px -1px 1px rgba(56, 56, 56, 0.25) !important;}::-webkit-scrollbar-thumb:active{background-color:rgba(56, 56, 56, 0.7) !important; box-shadow:inset 1px 1px 3px rgba(56, 56, 56, 0.35), inset -1px -1px 3px rgba(56, 56, 56, 0.35) !important;}::-webkit-scrollbar-corner{background:trnasparent !important;}html::-webkit-scrollbar,body::-webkit-scrollbar{background: rgba(56, 56, 56, 0.5) !important;}body * {background-color: rgba(56, 56, 56, 0.44) !important;}* {color: #B6AA7B !important;}a:link,a:link *,a:link:hover,a:link:hover *,a:link:active,a:link:active * {color: #B6AA7B !important;}a:visited,a:visited *,a:visited:hover,a:visited:hover *,a:visited:active,a:visited:active * {color: #D9C077 !important;}#_maxthon_night_mode_mask{position:fixed !important; left:0 !important; right:0 !important; top:0 !important; bottom:0 !important;z-index:100 !important; opacity:0.22 !important; background:#383838 !important; pointer-events:none !important;}
标签： C 代码
上传时间： 2015-12-13
上传用户：qq253363112
C语言接口与实现，一本过于学术的书 body {background: #383838 !important;}::-webkit-scrollbar{height:10px !important; width:10px !important; overflow:visible !important;}::-webkit-scrollbar-button{height:0 !important; width:0 !important; display:none !important;}::-webkit-scrollbar-track{box-shadow:none !important;}::-webkit-scrollbar-track:hover{background-color:rgba(56, 56, 56, 0.03) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-track:active{background-color:rgba(56, 56, 56, 0.04) !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.14), inset -1px -1px 0 rgba(56, 56, 56, 0.14) !important;}::-webkit-scrollbar-thumb{background-clip:padding-box !important; background-color:rgba(56, 56, 56, 0.2) !important;}::-webkit-scrollbar-thumb:vertical{min-height:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:horizontal{min-width:28px !important; box-shadow:inset 1px 1px 0 rgba(56, 56, 56, 0.1), inset -1px -1px 0 rgba(56, 56, 56, 0.1) !important;}::-webkit-scrollbar-thumb:hover{background-color:rgba(56, 56, 56, 0.6) !important; box-shadow:inset 1px 1px 1px rgba(56, 56, 56, 0.25), inset -1px -1px 1px rgba(56, 56, 56, 0.25) !important;}::-webkit-scrollbar-thumb:active{background-color:rgba(56, 56, 56, 0.7) !important; box-shadow:inset 1px 1px 3px rgba(56, 56, 56, 0.35), inset -1px -1px 3px rgba(56, 56, 56, 0.35) !important;}::-webkit-scrollbar-corner{background:trnasparent !important;}html::-webkit-scrollbar,body::-webkit-scrollbar{background: rgba(56, 56, 56, 0.5) !important;}body * {background-color: rgba(56, 56, 56, 0.44) !important;}* {color: #B6AA7B !important;}a:link,a:link *,a:link:hover,a:link:hover *,a:link:active,a:link:active * {color: #B6AA7B !important;}a:visited,a:visited *,a:visited:hover,a:visited:hover *,a:visited:active,a:visited:active * {color: #D9C077 !important;}#_maxthon_night_mode_mask{position:fixed !important; left:0 !important; right:0 !important; top:0 !important; bottom:0 !important;z-index:100 !important; opacity:0.22 !important; background:#383838 !important; pointer-events:none !important;}
标签： c语言 接口与实现
上传时间： 2015-12-13
上传用户：qq253363112
#include <stdlib.h> #include<stdio.h> #include <malloc.h> #define stack_init_size 100 #define stackincrement 10 typedef struct sqstack { int *base; int *top; int stacksize; } sqstack; int StackInit(sqstack *s) { s->base=(int *)malloc(stack_init_size *sizeof(int)); if(!s->base) return 0; s->top=s->base; s->stacksize=stack_init_size; return 1; } int Push(sqstack *s,int e) { if(s->top-s->base>=s->stacksize) { s->base=(int *)realloc(s->base,(s->stacksize+stackincrement)*sizeof(int)); if(!s->base) return 0; s->top=s->base+s->stacksize; s->stacksize+=stackincrement; } *(s->top++)=e; return e; } int Pop(sqstack *s,int e) { if(s->top==s->base) return 0; e=*--s->top; return e; } int stackempty(sqstack *s) { if(s->top==s->base) { return 1; } else { return 0; } } int conversion(sqstack *s) { int n,e=0,flag=0; printf("输入要转化的十进制数：\n"); scanf("%d",&n); printf("要转化为多少进制：\n"); scanf("%d",&flag); printf("将十进制数%d 转化为%d 进制是：\n",n,flag); while(n) { Push(s,n%flag); n=n/flag; } while(!stackempty(s)) { e=Pop(s,e); switch(e) { case 10: printf("A"); break; case 11: printf("B"); break; case 12: printf("C"); break; case 13: printf("D"); break; case 14: printf("E"); break; case 15: printf("F"); break; default: printf("%d",e); } } printf("\n"); return 0; } int main() { sqstack s; StackInit(&s); conversion(&s); return 0; }
上传时间： 2016-12-08
上传用户：爱你198
#include <malloc.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define NULL 0 #define MaxSize 30 typedef struct athletestruct /*运动员*/ { char name[20]; int score; /*分数*/ int range; /**/ int item; /*项目*/ }ATH; typedef struct schoolstruct /*学校*/ { int count; /*编号*/ int serial; /**/ int menscore; /*男选手分数*/ int womenscore; /*女选手分数*/ int totalscore; /*总分*/ ATH athlete[MaxSize]; /**/ struct schoolstruct *next; }SCH; int nsc,msp,wsp; int ntsp; int i,j; int overgame; int serial,range; int n; SCH *head,*pfirst,*psecond; int *phead=NULL,*pafirst=NULL,*pasecond=NULL; void create(); void input () { char answer; head = (SCH *)malloc(sizeof(SCH)); /**/ head->next = NULL; pfirst = head; answer = 'y'; while ( answer == 'y' ) { Is_Game_DoMain: printf("\nGET Top 5 when odd\nGET Top 3 when even"); printf("\n输入运动项目序号 (x<=%d):",ntsp); scanf("%d",pafirst); overgame = *pafirst; if ( pafirst != phead ) { for ( pasecond = phead ; pasecond < pafirst ; pasecond ++ ) { if ( overgame == *pasecond ) { printf("\n这个项目已经存在请选择其他的数字\n"); goto Is_Game_DoMain; } } } pafirst = pafirst + 1; if ( overgame > ntsp ) { printf("\n项目不存在"); printf("\n请重新输入"); goto Is_Game_DoMain; } switch ( overgame%2 ) { case 0: n = 3;break; case 1: n = 5;break; } for ( i = 1 ; i <= n ; i++ ) { Is_Serial_DoMain: printf("\n输入序号 of the NO.%d (0<x<=%d): ",i,nsc); scanf("%d",&serial); if ( serial > nsc ) { printf("\n超过学校数目,请重新输入"); goto Is_Serial_DoMain; } if ( head->next == NULL ) { create(); } psecond = head->next ; while ( psecond != NULL ) { if ( psecond->serial == serial ) { pfirst = psecond; pfirst->count = pfirst->count + 1; goto Store_Data; } else { psecond = psecond->next; } } create(); Store_Data: pfirst->athlete[pfirst->count].item = overgame; pfirst->athlete[pfirst->count].range = i; pfirst->serial = serial; printf("Input name:) : "); scanf("%s",pfirst->athlete[pfirst->count].name); } printf("\n继续输入运动项目(y&n)？"); answer = getchar(); printf("\n"); } } void calculate() /**/ { pfirst = head->next; while ( pfirst->next != NULL ) { for (i=1;i<=pfirst->count;i++) { if ( pfirst->athlete[i].item % 2 == 0 ) { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 5;break; case 2:pfirst->athlete[i].score = 3;break; case 3:pfirst->athlete[i].score = 2;break; } } else { switch (pfirst->athlete[i].range) { case 1:pfirst->athlete[i].score = 7;break; case 2:pfirst->athlete[i].score = 5;break; case 3:pfirst->athlete[i].score = 3;break; case 4:pfirst->athlete[i].score = 2;break; case 5:pfirst->athlete[i].score = 1;break; } } if ( pfirst->athlete[i].item <=msp ) { pfirst->menscore = pfirst->menscore + pfirst->athlete[i].score; } else { pfirst->womenscore = pfirst->womenscore + pfirst->athlete[i].score; } } pfirst->totalscore = pfirst->menscore + pfirst->womenscore; pfirst = pfirst->next; } } void output() { pfirst = head->next; psecond = head->next; while ( pfirst->next != NULL ) { // clrscr(); printf("\n第%d号学校的结果成绩:",pfirst->serial); printf("\n\n项目的数目\t学校的名字\t分数"); for (i=1;i<=ntsp;i++) { for (j=1;j<=pfirst->count;j++) { if ( pfirst->athlete[j].item == i ) { printf("\n %d\t\t\t\t\t\t%s\n %d",i,pfirst->athlete[j].name,pfirst->athlete[j].score);break; } } } printf("\n\n\n\t\t\t\t\t\t按任意建 进入下一页"); getchar(); pfirst = pfirst->next; } // clrscr(); printf("\n运动会结果:\n\n学校编号\t男运动员成绩\t女运动员成绩\t总分"); pfirst = head->next; while ( pfirst->next != NULL ) { printf("\n %d\t\t %d\t\t %d\t\t %d",pfirst->serial,pfirst->menscore,pfirst->womenscore,pfirst->totalscore); pfirst = pfirst->next; } printf("\n\n\n\t\t\t\t\t\t\t按任意建结束"); getchar(); } void create() { pfirst = (struct schoolstruct *)malloc(sizeof(struct schoolstruct)); pfirst->next = head->next ; head->next = pfirst ; pfirst->count = 1; pfirst->menscore = 0; pfirst->womenscore = 0; pfirst->totalscore = 0; } void Save() {FILE *fp; if((fp = fopen("school.dat","wb"))==NULL) {printf("can't open school.dat\n"); fclose(fp); return; } fwrite(pfirst,sizeof(SCH),10,fp); fclose(fp); printf("文件已经成功保存\n"); } void main() { system("cls"); printf("\n\t\t\t 运动会分数统计\n"); printf("输入学校数目 (x>= 5):"); scanf("%d",&nsc); printf("输入男选手的项目(x<=20):"); scanf("%d",&msp); printf("输入女选手项目(<=20):"); scanf("%d",&wsp); ntsp = msp + wsp; phead = (int *)calloc(ntsp,sizeof(int)); pafirst = phead; pasecond = phead; input(); calculate(); output(); Save(); }
标签： 源代码
上传时间： 2016-12-28
上传用户：150501
The AP2406 is a 1.5Mhz constant frequency, slope compensated current mode PWM step-down converter. The device integrates a main switch and a synchronous rectifier for high efficiency without an external Schottky diode. It is ideal for powering portable equipment that runs from a single cell lithium-Ion (Li+) battery. The AP2406 can supply 600mA of load current from a 2.5V to 5.5V input voltage. The output voltage can be regulated as low as 0.6V. The AP2406 can also run at 100% duty cycle for low dropout operation, extending battery life in portable system. Idle mode operation at light loads provides very low output ripple voltage for noise sensitive applications. The AP2406 is offered in a low profile (1mm) 5-pin, thin SOT package, and is available in an adjustable version and fixed output voltage of 1.2V, 1.5V and 1.8V
上传时间： 2017-02-23
上传用户：w124141
Lithium–sulfur (Li–S) batteries with high energy density and long cycle life are considered to be one of the most promising next-generation energy-storage systems beyond routine lithium-ion batteries. Various approaches have been proposed to break down technical barriers in Li–S battery systems. The use of nanostructured metal oxides and sulfides for high sulfur utilization and long life span of Li–S batteries is reviewed here. The relationships between the intrinsic properties of metal oxide/sulfide hosts and electrochemical performances of Li–S batteries are discussed. Nanostructured metal oxides/ sulfides hosts used in solid sulfur cathodes, separators/interlayers, lithium- metal-anode protection, and lithium polysulfides batteries are discussed respectively. Prospects for the future developments of Li–S batteries with nanostructured metal oxides/sulfides are also discussed.
上传时间： 2017-11-23
上传用户：653357637
#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;//链队列 typedef struct { ElemType *base; int front,rear; }SqQueue;//顺序队列 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．采用链式存储实现栈的初始化、入栈、出栈操作。 LinkList CreateStack()//创建栈 { 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．采用顺序存储实现栈的初始化、入栈、出栈操作。 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．采用链式存储实现队列的初始化、入队、出队操作。 LinkList InitQueue()//创建 { LinkList head; head->rear=(LinkQueue)malloc(sizeof(Node)); head->front=head->rear; head->front->next=NULL; return head; } void deleteEle(LinkList head,int &e)//出队 { 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)//入队 { 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．采用顺序存储实现循环队列的初始化、入队、出队操作。 bool InitQueue(SqQueue &head)//创建队列 { head.data=(int *)malloc(sizeof(int)); head.front=head.rear=0; return 1; } bool EnQueue(SqQueue &head,int e)//入队 { if((head.rear+1)%MAXQSIZE==head.front) { printf("队列已满\n"); return 0; } head.data[head.rear]=e; head.rear=(head.rear+1)%MAXQSIZE; return 1; } int QueueLengthead(SqQueue &head)//返回队列长度 { return (head.rear-head.front+MAXQSIZE)%MAXQSIZE; } bool deleteEle(SqQueue &head,int &e)//出队 { if(head.front==head.rear) { cout<<"队列为空！"<<endl; return 0; } e=head.data[head.front]; head.front=(head.front+1)%MAXQSIZE; return 1; } int gethead(SqQueue head)//得到队列头元素 { return head.data[head.front]; } int QueueEmpty(SqQueue head)//判断队列是否为空 { 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．在主函数中设计一个简单的菜单，分别测试上述算法。 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); }//以上是链队列的测试 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; }
上传时间： 2018-05-09
上传用户：123456..
top开发板的小灯泡闪烁实验，top开发板的小灯泡闪烁实验，top开发板的小灯泡闪烁实验，
上传时间： 2019-07-03
上传用户：whpu
