N次遍历数组

Question

我想知道是否有可能遍历一个数组N次，停止做一些工作然后再遍历N次遍历。

我认为它涉及嵌套的循环结构，但是我不确定如何构造它。

Answer 1

您只需要计算迭代次数，就需要每50个“工作”：

HANDLE hReadPipe, hWritePipe;
CreatePipe(&hReadPipe, &hWritePipe, &rSA, 25000);

PROCESS_INFORMATION rPI = { 0 };
STARTUPINFOA        rSI = { 0 };

rSI.cb          = sizeof(rSI);
rSI.lpTitle     = (LPSTR)"SubProject";
rSI.dwFlags     = STARTF_USESHOWWINDOW | STARTF_USESTDHANDLES;
rSI.wShowWindow = SW_SHOWNORMAL;// SW_HIDE or SW_SHOWNORMAL or SW_MINIMIZE
rSI.hStdOutput  = hWritePipe;
rSI.hStdError   = hWritePipe;

std::string sCmd = szCmd;

BOOL fRet = 
    CreateProcessA(
        NULL,
        (LPSTR)(LPCSTR)sCmd.c_str(),
        NULL,                       // Inherit Process Handle
        NULL,                       // Inherit Thread Handle
        TRUE,                       // Inherit from current process
        CREATE_NEW_CONSOLE,         // Console Creation Flags
        0,                          // Environment Block
        0,                          // Starting Directory
        &rSI,                       // Startup Info
        &rPI                        // Process Info
    );

对您问题的另一种解释：

int count = 0 ;
for(;;)
{
     // do xxxx on array element on every iteration
     xxxx(  array[count] ) ;

     if( count == N - 1 )
     {
         count = 0 ;

         // Do yyyy this every N iterations
         yyyy() ;
     }

     count++ ;
}