簡單高效刪除數組成員(非穩定性)的代碼

目的：實現一個高效代碼實現簡單的刪除數組中的需要刪除的成員的功能代碼

代碼如下所示：

/* tom 2019-12-06 PM 21:50 */

#include <stdio.h>

typedef int 	BOOL;
#define TRUE 	(1)
#define FALSE 	(0)

typedef struct tagNode
{
	BOOL bToDelete;
	int iValue;
	
	tagNode(const BOOL bToDelete, const int iValue)
	{
		this->bToDelete = bToDelete;
		this->iValue	= iValue;
	}
}NODE_ST;

int main()
{
	NODE_ST astNode[5] = {
		NODE_ST(FALSE, 1),	
		NODE_ST(TRUE,  2),	/* need to delete */
		NODE_ST(FALSE, 3),
		NODE_ST(TRUE,  4),	/* need to delete */
		NODE_ST(FALSE, 5)};

	int iNodeNum = sizeof(astNode) / sizeof(NODE_ST);
	
	NODE_ST* const 	pstNodeBgn 	= astNode;
	NODE_ST*  		pstNodeEnd 	= astNode + sizeof(astNode) / sizeof(NODE_ST);
	NODE_ST* 		pstNode 	= NULL;
	
	/* 打印原始數組 */
	printf("[%s:%d] dump original list(%d) as follows:\n", __FUNCTION__, __LINE__, iNodeNum);
	for (pstNode = pstNodeBgn; pstNode < pstNodeEnd; ++pstNode)
	{
		printf("[%d.%d] value:%d, needDelete:%s\n", iNodeNum, pstNode - pstNodeBgn, pstNode->iValue, pstNode->bToDelete ? "yes" : "no");
	}
	
	/* 刪除數組中需要刪除的節點 */
	for (pstNode = pstNodeBgn; pstNode < pstNodeEnd;)
	{
		/* 刪除需要delete的成員 */
		if (pstNode->bToDelete)
		{
			*pstNode = *--pstNodeEnd;
		}
		/* next */ 
		else
		{
			++pstNode;
		}
	}
	
	/* 更新數組有效長度 */
	iNodeNum = pstNodeEnd - pstNodeBgn;
	
	/* 打印最新的數組 */
	printf("\n[%s:%d] after delete action, dump list(%d) as follows:\n", __FUNCTION__, __LINE__, iNodeNum);
	pstNodeEnd = pstNodeBgn + iNodeNum;
	for (pstNode = pstNodeBgn; pstNode < pstNodeEnd; ++pstNode)
	{
		printf("[%d.%d] value:%d, needDelete:%s\n", iNodeNum, pstNode - pstNodeBgn, pstNode->iValue, pstNode->bToDelete ? "yes" : "no");
	}
	
	return 0;
}

程序結果: