Breaking News: Grepper is joining You.com. Read the official announcement!

matrix traversal

Vivacious Vendace answered on January 23, 2023 Popularity 6/10 Helpfulness 4/10

answer matrix traversal

matrix traversal

Comment

//traversal in all eight direction
 private void Traverse(int i, int j, char[][] grid) {
        int drow[] = {-1, 0, +1, 0, -1, -1, +1, +1};
        int dcol[] = {0, 1, 0, -1 , +1, -1, +1, -1};
        for (int k = 0; k < 8; k++) {
            int nrow = i + drow[k];
            int ncol = j + dcol[k];
            if (nrow >= 0 && nrow < r && ncol >= 0 && ncol < c &&grid[nrow][ncol] == '1') {
                //your code
            }
        }
    }

Popularity 6/10 Helpfulness 4/10 Language whatever

Source: Grepper

Tags: matrix traversal whatever

Link to this answer
Share Copy Link

Contributed on Jan 23 2023

Vivacious Vendace

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

matrix traversal

Contents

More Related Answers

matrix traversal

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.