Sta*_*ela -1 c++ algorithm flowchart
是否可以在没有变量的情况下将此流程图编写到C++中goto?

这就是我已经拥有的:
i1;
i2;
if(w1) {
i3;
while(w2) {
i2;
if(w1) { break; } // and it shouldn't do i4;
i3;
}
i4;
}
i5;
Run Code Online (Sandbox Code Playgroud)
你可以通过一些简单的递归来完成它.您必须小心,您的递归具有适当的"停止"条件,以避免堆栈溢出.
将每个"盒子"命名为一个函数,我们基本上得到以下内容:
#include <iostream>
using namespace std;
void start_flowing();
int main()
{
// This is the topmost "box"
start_flowing();
return 0;
}
void action_0(); // first "action" box
void check_0(); // first "decision" box
void action_1(); // second "action" box
void check_1(); // second "decision" box
void action_2(); // third "action" box
void complete(); // final "action" box
void start_flowing()
{
// first box goes to second box directly
action_0();
}
void action_0()
{
// first action box goes to first decision directly
check_0();
}
void check_0()
{
// whatever this means...
// this does the evaluation of the decision
bool result = do_the_check();
if(result)
{
// continue "down" to next action box
action_1();
}
else
{
// short circuit out to completion
complete();
}
}
void action_1()
{
check_1();
}
void check_1()
{
// whatever this means...
// this does the evaluation of the decision
bool result = do_the_check();
if(result)
{
// continue "down" to next action box
action_2();
}
else
{
// jump back "up" to first action box
action_0();
}
}
void action_2()
{
// completes the sequence
complete();
}
Run Code Online (Sandbox Code Playgroud)