Leetcode-999. Available Captures for Rook

—Easy

https://leetcode.com/problems/available-captures-for-rook/

 Code:

class Solution:
    def numRookCaptures(self, board) -> int:
        ans_cnt = 0
        m = len(board)
        n = len(board[0])
        for i in range(m):
            for j in range(n):
                if board[i][j] == 'R':
                    for e in range(0,i)[::-1]:
                        if board[e][j] == 'p':
                            ans_cnt += 1
                            #print('is here :', e, j)
                            break
                        if board[e][j] == 'B':
                            break
                        if board[e][j] == '.':
                            continue
                    for e in range(i+1,m):
                        if board[e][j] == 'p':
                            ans_cnt += 1
                            #print('is here :', e, j)
                            break
                        if board[e][j] == 'B':
                            break
                        if board[e][j] == '.':
                            continue
                    for e in range(0,j)[::-1]:
                        if board[i][e] == 'p':
                            ans_cnt += 1
                            #print('is here :', i, e)
                            break
                        if board[i][e] == 'B':
                            break
                        if board[i][e] == '.':
                            continue
                    for e in range(j+1,n):
                        if board[i][e] == 'p':
                            ans_cnt += 1
                            #print('is here :',i,e)
                            break
                        if board[i][e] == 'B':
                            break
                        if board[i][e] == '.':
                            continue
                    break
        return ans_cnt

# s = Solution()
# print(s.numRookCaptures([[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","R",".",".",".","p"],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]))
# print(s.numRookCaptures([[".",".",".",".",".",".",".","."],[".","p","p","p","p","p",".","."],[".","p","p","B","p","p",".","."],[".","p","B","R","B","p",".","."],[".","p","p","B","p","p",".","."],[".","p","p","p","p","p",".","."],[".",".",".",".",".",".",".","."],[".",".",".",".",".",".",".","."]]))
# print(s.numRookCaptures([[".",".",".",".",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".","p",".",".",".","."],["p","p",".","R",".","p","B","."],[".",".",".",".",".",".",".","."],[".",".",".","B",".",".",".","."],[".",".",".","p",".",".",".","."],[".",".",".",".",".",".",".","."]]))

思路:

1.找到R的位置进行上下左右四个方向遍历即可

2.range的逆序

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值