Leetcode 999. 可以被一步捕获的棋子数（车沿着四个方向遍历判断）

最新推荐文章于 2024-09-15 20:59:24 发布

wwxy261

最新推荐文章于 2024-09-15 20:59:24 发布

阅读量122

点赞数

分类专栏：算法文章标签： p2p linq gnu

本文链接：https://blog.csdn.net/wwxy1995/article/details/122422941

版权

算法专栏收录该内容

3633 篇文章 120 订阅

订阅专栏

class Solution {
public:
    int numRookCaptures(vector<vector<char>>& board) {
        int cnt = 0, st = 0, ed = 0;
        int dx[4] = {0, 1, 0, -1};
        int dy[4] = {1, 0, -1, 0};
        for (int i = 0; i < 8; ++i) {
            for (int j = 0; j < 8; ++j) {
                if (board[i][j] == 'R') {
                    st = i;
                    ed = j;
                    break;
                }
            }
        }
        for (int i = 0; i < 4; ++i) {
            for (int step = 0;; ++step) {
                int tx = st + step * dx[i];
                int ty = ed + step * dy[i];
                if (tx < 0 || tx >= 8 || ty < 0 || ty >= 8 || board[tx][ty] == 'B') {
                    break;
                }
                if (board[tx][ty] == 'p') {
                    cnt++;
                    break;
                }
            }
        }
        return cnt;
    }
};