定义一个数组，先进先出。怎样做效率高一点

[xia8710279]

自己想的方法
unsigned char A_buff[MAX_NUM]; //定义一个数组，长度为MAX_NUM

unsigned char HeadNum =MAX_NUM ; // 堆栈的头的编号
unsigned char EndNum = MAX_NUM; //堆栈尾的编号



[code=c]unsigned char Out_Stack(void) //出栈函数
{
uchar a;
if(HeadNum == EndNum )
{
return NULL_DATA; //堆栈内没有数据
}
else
{
a=A_buff[HeadNum];
HeadNum++;
if(HeadNum >=MAX_NUM )
{
HeadNum =0;
}
return A_buff[HeadNum];
}
}

//进堆栈 函数
uint8 In_Stack( unsigned char InData) //返回进堆栈是否成功
{
unsigned char a=EndNum;
EndNum++;
if(EndNum >= MAX_NUM )
{
EndNum = 0;
}
if(EndNum ==HeadNum)
{//堆栈已满,返回失败
EndNum=a;
return FALSE;
}
else
{
A_buff[EndNum]=InData;
return TRUE;
}
}



大家看看这个方法好不好

[brookmill]

我觉得大致的思路也就是这样了，很简单，效率也不错，我想不到效率更高的办法，也许有高手可以。 几个细节要注意： a=A_buff[HeadNum]; 这个a后来没用到呀。两个可能：或者a就没用，或者应该return a，这个细节楼主自己调试吧，我没时间细看了。 不知道你打算把NULL_DATA定义成什么，不管是0xFF还是0还是别的什么值，都无法和正常值区分开，所以我建议把这个函数改成 BOOL Out_Stack(unsigned char *ret_value); 先进先出的是队列queue，不是栈stack。c程序员的字典里没有“堆栈”这个词，只有“堆”和“栈” uchar、unsigned char、uint8 太乱了，要一致才好。head对应tail，begin对应end

[xia8710279]

多谢指点

[FightForProgrammer]

这个实用性不够强吧。只能保存字符呀

[zilaishuichina]

C的话 简单写一个， 用数组做的循环队列

const int capacity = 10;//队列最大元素个数
typedef struct Queue
{
	int m_array[capacity];
	int m_front;//首元素下标
	int m_rear;//尾元素下标
	int m_size;//当前元素个数
}Queue;

void InitQueue(Queue *pQueue)
{
	pQueue->m_front = 0;
	pQueue->m_rear = 0;
	pQueue->m_size = 0;
}

bool IsFull(Queue *pQueue)
{
	return pQueue->m_size == capacity ? true : false;
}

void Push(Queue *pQueue, int v)
{
	pQueue->m_array[pQueue->m_rear] = v;

	pQueue->m_rear++;
	if (pQueue->m_rear == capacity)
	{
		pQueue->m_rear = 0;
	}

	pQueue->m_size++;
}

bool IsEmpty(Queue *pQueue)
{
	return pQueue->m_size == 0 ? true : false;
}

int Pop(Queue *pQueue)
{
	int current = pQueue->m_front;

	pQueue->m_front++;
	if (pQueue->m_front == capacity)
	{
		pQueue->m_front = 0;
	}

	pQueue->m_size--;

	return pQueue->m_array[current];
}

[xia8710279]

回复

引用 4 楼 zilaishuichina 的回复:

C的话 简单写一个， 用数组做的循环队列

const int capacity = 10;//队列最大元素个数
typedef struct Queue
{
	int m_array[capacity];
	int m_front;//首元素下标
	int m_rear;//尾元素下标
	int m_size;//当前元素个数
}Queue;

void InitQueue(Queue *pQueue)
{
	pQueue->m_front = 0;
	pQueue->m_rear = 0;
	pQueue->m_size = 0;
}

bool IsFull(Queue *pQueue)
{
	return pQueue->m_size == capacity ? true : false;
}

void Push(Queue *pQueue, int v)
{
	pQueue->m_array[pQueue->m_rear] = v;

	pQueue->m_rear++;
	if (pQueue->m_rear == capacity)
	{
		pQueue->m_rear = 0;
	}

	pQueue->m_size++;
}

bool IsEmpty(Queue *pQueue)
{
	return pQueue->m_size == 0 ? true : false;
}

int Pop(Queue *pQueue)
{
	int current = pQueue->m_front;

	pQueue->m_front++;
	if (pQueue->m_front == capacity)
	{
		pQueue->m_front = 0;
	}

	pQueue->m_size--;

	return pQueue->m_array[current];
}

这个不错，再在进队列和出队列的时候调用bool IsFull(Queue *pQueue)，bool IsEmpty(Queue *pQueue)

[xia8710279]

引用 5 楼 my_live_123 的回复:

数组循环队列

差不多

[一根烂笔头]

数组循环队列

[jmppok]

我觉着用STL就行 个人写的还是不如STL

[schlafenhamster]

通常要（取模） “%队列长度”。 pQueue->m_front = 0; ？？？

[赵4老师]

仅供参考：

//循环向a函数每次发送200个字节长度（这个是固定的）的buffer,
//a函数中需要将循环传进来的buffer，组成240字节（也是固定的）的新buffer进行处理，
//在处理的时候每次从新buffer中取两个字节打印
#ifdef WIN32
    #pragma warning(disable:4996)
#endif
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#ifdef WIN32
    #include <windows.h>
    #include <process.h>
    #include <io.h>
    #define  MYVOID             void
    #define  vsnprintf          _vsnprintf
#else
    #include <unistd.h>
    #include <sys/time.h>
    #include <pthread.h>
    #define  CRITICAL_SECTION   pthread_mutex_t
    #define  MYVOID             void *
#endif
//Log{
#define MAXLOGSIZE 20000000
#define MAXLINSIZE 16000
#include <time.h>
#include <sys/timeb.h>
#include <stdarg.h>
char logfilename1[]="MyLog1.log";
char logfilename2[]="MyLog2.log";
static char logstr[MAXLINSIZE+1];
char datestr[16];
char timestr[16];
char mss[4];
CRITICAL_SECTION cs_log;
FILE *flog;
#ifdef WIN32
void Lock(CRITICAL_SECTION *l) {
    EnterCriticalSection(l);
}
void Unlock(CRITICAL_SECTION *l) {
    LeaveCriticalSection(l);
}
void sleep_ms(int ms) {
    Sleep(ms);
}
#else
void Lock(CRITICAL_SECTION *l) {
    pthread_mutex_lock(l);
}
void Unlock(CRITICAL_SECTION *l) {
    pthread_mutex_unlock(l);
}
void sleep_ms(int ms) {
    usleep(ms*1000);
}
#endif
void LogV(const char *pszFmt,va_list argp) {
    struct tm *now;
    struct timeb tb;

    if (NULL==pszFmt||0==pszFmt[0]) return;
    vsnprintf(logstr,MAXLINSIZE,pszFmt,argp);
    ftime(&tb);
    now=localtime(&tb.time);
    sprintf(datestr,"%04d-%02d-%02d",now->tm_year+1900,now->tm_mon+1,now->tm_mday);
    sprintf(timestr,"%02d:%02d:%02d",now->tm_hour     ,now->tm_min  ,now->tm_sec );
    sprintf(mss,"%03d",tb.millitm);
    printf("%s %s.%s %s",datestr,timestr,mss,logstr);
    flog=fopen(logfilename1,"a");
    if (NULL!=flog) {
        fprintf(flog,"%s %s.%s %s",datestr,timestr,mss,logstr);
        if (ftell(flog)>MAXLOGSIZE) {
            fclose(flog);
            if (rename(logfilename1,logfilename2)) {
                remove(logfilename2);
                rename(logfilename1,logfilename2);
            }
        } else {
            fclose(flog);
        }
    }
}
void Log(const char *pszFmt,...) {
    va_list argp;

    Lock(&cs_log);
    va_start(argp,pszFmt);
    LogV(pszFmt,argp);
    va_end(argp);
    Unlock(&cs_log);
}
//Log}
#define ASIZE    200
#define BSIZE    240
#define CSIZE      2
char Abuf[ASIZE];
char Cbuf[CSIZE];
CRITICAL_SECTION cs_HEX ;
CRITICAL_SECTION cs_BBB ;
struct FIFO_BUFFER {
    int  head;
    int  tail;
    int  size;
    char data[BSIZE];
} BBB;
int No_Loop=0;
void HexDump(int cn,char *buf,int len) {
    int i,j,k;
    char binstr[80];

    Lock(&cs_HEX);
    for (i=0;i<len;i++) {
        if (0==(i%16)) {
            sprintf(binstr,"%03d %04x -",cn,i);
            sprintf(binstr,"%s %02x",binstr,(unsigned char)buf[i]);
        } else if (15==(i%16)) {
            sprintf(binstr,"%s %02x",binstr,(unsigned char)buf[i]);
            sprintf(binstr,"%s  ",binstr);
            for (j=i-15;j<=i;j++) {
                sprintf(binstr,"%s%c",binstr,('!'<buf[j]&&buf[j]<='~')?buf[j]:'.');
            }
            Log("%s\n",binstr);
        } else {
            sprintf(binstr,"%s %02x",binstr,(unsigned char)buf[i]);
        }
    }
    if (0!=(i%16)) {
        k=16-(i%16);
        for (j=0;j<k;j++) {
            sprintf(binstr,"%s   ",binstr);
        }
        sprintf(binstr,"%s  ",binstr);
        k=16-k;
        for (j=i-k;j<i;j++) {
            sprintf(binstr,"%s%c",binstr,('!'<buf[j]&&buf[j]<='~')?buf[j]:'.');
        }
        Log("%s\n",binstr);
    }
    Unlock(&cs_HEX);
}
int GetFromRBuf(int cn,CRITICAL_SECTION *cs,FIFO_BUFFER *fbuf,char *buf,int len) {
    int lent,len1,len2;

    lent=0;
    Lock(cs);
    if (fbuf->size>=len) {
        lent=len;
        if (fbuf->head+lent>BSIZE) {
            len1=BSIZE-fbuf->head;
            memcpy(buf     ,fbuf->data+fbuf->head,len1);
            len2=lent-len1;
            memcpy(buf+len1,fbuf->data           ,len2);
            fbuf->head=len2;
        } else {
            memcpy(buf     ,fbuf->data+fbuf->head,lent);
            fbuf->head+=lent;
        }
        fbuf->size-=lent;
    }
    Unlock(cs);
    return lent;
}
MYVOID thdB(void *pcn) {
    char        *recv_buf;
    int          recv_nbytes;
    int          cn;
    int          wc;
    int          pb;

    cn=(int)pcn;
    Log("%03d thdB              thread begin...\n",cn);
    while (1) {
        sleep_ms(10);
        recv_buf=(char *)Cbuf;
        recv_nbytes=CSIZE;
        wc=0;
        while (1) {
            pb=GetFromRBuf(cn,&cs_BBB,&BBB,recv_buf,recv_nbytes);
            if (pb) {
                Log("%03d recv %d bytes\n",cn,pb);
                HexDump(cn,recv_buf,pb);
                sleep_ms(1);
            } else {
                sleep_ms(1000);
            }
            if (No_Loop) break;//
            wc++;
            if (wc>3600) Log("%03d %d==wc>3600!\n",cn,wc);
        }
        if (No_Loop) break;//
    }
#ifndef WIN32
    pthread_exit(NULL);
#endif
}
int PutToRBuf(int cn,CRITICAL_SECTION *cs,FIFO_BUFFER *fbuf,char *buf,int len) {
    int lent,len1,len2;

    Lock(cs);
    lent=len;
    if (fbuf->size+lent>BSIZE) {
        lent=BSIZE-fbuf->size;
    }
    if (fbuf->tail+lent>BSIZE) {
        len1=BSIZE-fbuf->tail;
        memcpy(fbuf->data+fbuf->tail,buf     ,len1);
        len2=lent-len1;
        memcpy(fbuf->data           ,buf+len1,len2);
        fbuf->tail=len2;
    } else {
        memcpy(fbuf->data+fbuf->tail,buf     ,lent);
        fbuf->tail+=lent;
    }
    fbuf->size+=lent;
    Unlock(cs);
    return lent;
}
MYVOID thdA(void *pcn) {
    char        *send_buf;
    int          send_nbytes;
    int          cn;
    int          wc;
    int           a;
    int          pa;

    cn=(int)pcn;
    Log("%03d thdA              thread begin...\n",cn);
    a=0;
    while (1) {
        sleep_ms(100);
        memset(Abuf,a,ASIZE);
        a=(a+1)%256;
        if (16==a) {No_Loop=1;break;}//去掉这句可以让程序一直循环直到按Ctrl+C或Ctrl+Break或当前目录下存在文件No_Loop
        send_buf=(char *)Abuf;
        send_nbytes=ASIZE;
        Log("%03d sending %d bytes\n",cn,send_nbytes);
        HexDump(cn,send_buf,send_nbytes);
        wc=0;
        while (1) {
            pa=PutToRBuf(cn,&cs_BBB,&BBB,send_buf,send_nbytes);
            Log("%03d sent %d bytes\n",cn,pa);
            HexDump(cn,send_buf,pa);
            send_buf+=pa;
            send_nbytes-=pa;
            if (send_nbytes<=0) break;//
            sleep_ms(1000);
            if (No_Loop) break;//
            wc++;
            if (wc>3600) Log("%03d %d==wc>3600!\n",cn,wc);
        }
        if (No_Loop) break;//
    }
#ifndef WIN32
    pthread_exit(NULL);
#endif
}
int main() {
#ifdef WIN32
    InitializeCriticalSection(&cs_log);
    InitializeCriticalSection(&cs_HEX );
    InitializeCriticalSection(&cs_BBB );
#else
    pthread_t threads[2];
    int threadsN;
    int rc;
    pthread_mutex_init(&cs_log,NULL);
    pthread_mutex_init(&cs_HEX,NULL);
    pthread_mutex_init(&cs_BBB,NULL);
#endif
    Log("Start===========================================================\n");

    BBB.head=0;
    BBB.tail=0;
    BBB.size=0;

#ifdef WIN32
    _beginthread((void(__cdecl *)(void *))thdA,0,(void *)1);
    _beginthread((void(__cdecl *)(void *))thdB,0,(void *)2);
#else
    threadsN=0;
    rc=pthread_create(&(threads[threadsN++]),NULL,thdA,(void *)1);if (rc) Log("%d=pthread_create %d error!\n",rc,threadsN-1);
    rc=pthread_create(&(threads[threadsN++]),NULL,thdB,(void *)2);if (rc) Log("%d=pthread_create %d error!\n",rc,threadsN-1);
#endif

    if (!access("No_Loop",0)) {
        remove("No_Loop");
        if (!access("No_Loop",0)) {
            No_Loop=1;
        }
    }
    while (1) {
        sleep_ms(1000);
        if (No_Loop) break;//
        if (!access("No_Loop",0)) {
            No_Loop=1;
        }
    }
    sleep_ms(3000);
    Log("End=============================================================\n");
#ifdef WIN32
    DeleteCriticalSection(&cs_BBB );
    DeleteCriticalSection(&cs_HEX );
    DeleteCriticalSection(&cs_log);
#else
    pthread_mutex_destroy(&cs_BBB);
    pthread_mutex_destroy(&cs_HEX);
    pthread_mutex_destroy(&cs_log);
#endif
    return 0;
}

[有时想起]

引用 9 楼 xia8710279 的回复:

回复 [quote=引用 4 楼 zilaishuichina 的回复:] C的话 简单写一个， 用数组做的循环队列

const int capacity = 10;//队列最大元素个数
typedef struct Queue
{
	int m_array[capacity];
	int m_front;//首元素下标
	int m_rear;//尾元素下标
	int m_size;//当前元素个数
}Queue;

void InitQueue(Queue *pQueue)
{
	pQueue->m_front = 0;
	pQueue->m_rear = 0;
	pQueue->m_size = 0;
}

bool IsFull(Queue *pQueue)
{
	return pQueue->m_size == capacity ? true : false;
}

void Push(Queue *pQueue, int v)
{
	pQueue->m_array[pQueue->m_rear] = v;

	pQueue->m_rear++;
	if (pQueue->m_rear == capacity)
	{
		pQueue->m_rear = 0;
	}

	pQueue->m_size++;
}

bool IsEmpty(Queue *pQueue)
{
	return pQueue->m_size == 0 ? true : false;
}

int Pop(Queue *pQueue)
{
	int current = pQueue->m_front;

	pQueue->m_front++;
	if (pQueue->m_front == capacity)
	{
		pQueue->m_front = 0;
	}

	pQueue->m_size--;

	return pQueue->m_array[current];
}

这个不错，再在进队列和出队列的时候调用bool IsFull(Queue *pQueue)，bool IsEmpty(Queue *pQueue)[/quote] 再加个数组内求平均怎么做啊