C²ÎÊý´«µÝ - C/C++ / CÓïÑÔ
[code=C/C++][/code]
#include<stdio.h>
#include<malloc.h>
#define Maxsize 5
typedef struct elemtype
{
char data[Maxsize];
int front;
int rear;
/*char *font;
char *rear;*///²»Ê¹ÓÃÕâÖֽṹÊÇÓÐÆä²Ù×÷ÉϵIJ»±ãÐÔÔì³ÉµÄ£¬±ÈÈçclear()
//front ºÍrear Á½¸öÖ¸ÕëÊÇÔÚ²»¶ÏÒÆ¶¯µÄ£¬ÊÍ·ÅÆðÀ´ºÜ²»·½±ã£¡
}elemtype,*queue;
//void initqueue(queue q)
//{
// *&q=(queue)malloc(sizeof(elemtype));
// q->rear =q->front =0;
//}void clear(queue q)
{
free(q);
}
int queueempty(queue q)
{
return (q->rear ==q->front );
}
int queuelength(queue q)
{
return((q->rear -q->front +Maxsize)%Maxsize);
}
int enqueue(queue q,char c)
{
if((q->rear +1)%Maxsize==q->front )
return 0;
q->data[q->rear ]=c;
q->rear =(q->rear +1)%Maxsize;
return 1;
}
int dequeue(queue q,char *e)
{
if(q->rear ==q->front )
return 0;
*e=q->data [q->front ];
q->front =(q->front +1)%Maxsize;
return 1;
}
[code=C/C++][/code]
#include <stdio.h>
#define Maxsize 5
typedef struct elemtype
{
char data[Maxsize];
int front;
int rear;
/*char *font;
char *rear;*///²»Ê¹ÓÃÕâÖֽṹÊÇÓÐÆä²Ù×÷ÉϵIJ»±ãÐÔÔì³ÉµÄ£¬±ÈÈçclear()
//front ºÍrear Á½¸öÖ¸ÕëÊÇÔÚ²»¶ÏÒÆ¶¯µÄ£¬ÊÍ·ÅÆðÀ´ºÜ²
Ïà¹ØÎÊ´ð£º
±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......
´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......
ÔÚ¸ùĿ¼/libÖдæ·ÅÒ»¸ölog.c£¬log.h£¬²¢ÓÃÏÂÃæµÄÓï¾ä£º
gcc -c log.c
ar crv liblog.a log.o
±àÒë³öÒ»¸öliblog.a¾²Ì¬¿â£¬È»ºóÔÚÎļþ¼Ð£º/testfileÖд´½¨Ò»¸ötest.cºÍtestc.c£¬test.cÖÐÒýÓÃÁËtestc.cÖж¨ÒåµÄ·½·¨ ......
ËÄܰïÎÒ°ÑÏÂÃæÕâЩ´úÂë¸Ä³ÉVBÐÎʽµÄ£¬¶àлÁË£¬¼±ÓÃ~~
#include "stdlib.h"
#include "math.h"
#include "stdio.h"
float objfx(float x[]);
void constraint(float x[],float g ......