如何在复杂的算法中处理 goto function？

Question

I remove 4 goto function in my project but I cant deal with that. I hope you can help me I marked him on code. I try bool-break method but doesnt work, also I try the if but I cant handle myself I generated number randomly. Sometimes give true score but mostly it's stuck in some place I found where it is stuck but no solution on my way. Other removes work very well but that one not work.

void Solve()
{   
    if (check == 0)
        flag1 = 0;
    else if (flag1 != 0)
    {
        check3 = check;
        while (1)
        {           
            check2 = 0;
            while (1)
            {
                while (check2 < check)
                {
                    {
                        x = check4[check2];
                        z = rowInc[x];
                        for (y = 0; y <= length-1; y++)
                        {
                            if (count1[y])
                            {
                                int delMatrix;
                                delMatrix = mainMatrix[x][y] - z + colEq[y];
                                if (delMatrix < count1[y])
                                {
                                    if (delMatrix == 0)
                                    {
                                        if (rowEq[y] < 0)
                                        {
                                            goto breakthru;  //This section I want to remove
                                            //searching();
                                            //break2 = true;
                                            //break;
                                            //flag4 = 0; break;
                                        }

                                        count1[y] = 0;
                                        rowEq2[y] = x;

                                        check4[check++] = rowEq[y];
                                    }
                                    else
                                    {
                                        count1[y] = delMatrix;
                                        count1Row[y] = x;
                                    }
                                }
                            }
                        }
                    }
                    check2++;
                    flag4 = 1;
                }   
                if (1)
                {
                    z = lengthH;
                    for (y = 0; y < length; y++) 
                    {
                        if (count1[y] && count1[y] < z)
                            z = count1[y];
                    }
                    for (check2 = 0; check2 < check; check2++)
                    {
                        rowInc[check4[check2]] += z;
                    }
                    for (y = 0; y < length; y++)
                    {
                        if (count1[y])
                        {
                            count1[y] -= z;
                            if (count1[y] == 0)
                            {
                                x = count1Row[y];
                                if (rowEq[y] < 0)
                                {
                                    for (j = y + 1; j < length; j++)
                                        if (count1[j] == 0)
                                        {
                                            colEq[j] += z;
                                        }
                                    break1 = true;
                                    break;
                                }
                                else
                                {
                                    rowEq2[y] = x;
                                    check4[check++] = rowEq[y];
                                }
                            }
                        }
                        else
                            colEq[y] += z;
                    }
                    if (break1)break;
                }
            }
            breakthru:

Answer 1

One way is to create sub-function and use return:

void bar() {
    while (1)
    {
        while (check2 < check)
        {
            {
                x = check4[check2];
                z = rowInc[x];
                for (y = 0; y <= length-1; y++)
                {
                    if (count1[y])
                    {
                        int delMatrix;
                        delMatrix = mainMatrix[x][y] - z + colEq[y];
                        if (delMatrix < count1[y])
                        {
                            if (delMatrix == 0)
                            {
                                if (rowEq[y] < 0)
                                {
                                    return; // Return here.
                                }
                                count1[y] = 0;
                                rowEq2[y] = x;

                                check4[check++] = rowEq[y];
                            }
                            else
                            {
                                count1[y] = delMatrix;
                                count1Row[y] = x;
                            }
                        }
                    }
                }
            }
            check2++;
            flag4 = 1;
        }   
        {
            z = lengthH;
            for (y = 0; y < length; y++) 
            {
                if (count1[y] && count1[y] < z)
                    z = count1[y];
            }
            for (check2 = 0; check2 < check; check2++)
            {
                rowInc[check4[check2]] += z;
            }
            for (y = 0; y < length; y++)
            {
                if (count1[y])
                {
                    count1[y] -= z;
                    if (count1[y] == 0)
                    {
                        x = count1Row[y];
                        if (rowEq[y] < 0)
                        {
                            for (j = y + 1; j < length; j++)
                                if (count1[j] == 0)
                                {
                                    colEq[j] += z;
                                }
                            break1 = true;
                            break;
                        }
                        else
                        {
                            rowEq2[y] = x;
                            check4[check++] = rowEq[y];
                        }
                    }
                }
                else
                    colEq[y] += z;
            }
            if (break1)break;
        }
    }
}

and then

void Solve()
{   
    if (check == 0)
        flag1 = 0;
    else if (flag1 != 0)
    {
        check3 = check;
        while (1)
        {           
            check2 = 0;
            bar();

            // breakthru:
            // ...
        }
        // ...
    }
    // ...
}

Answer 2

There isn't any code after breakthru: , so I assume you want the function to stop immediatly when reaching goto breakthru; . In that case, replace goto breakthru; with return; and remove breakthru: .