This problem was asked by Google.
On our special chessboard, two bishops attack each other if they share the same diagonal. This includes bishops that have another bishop located between them, i.e. bishops can attack through pieces.On our spec
阅读背景：
[Daily Coding Problem 68] Count Pairs of attacking bishop pairs
来源：互联网
分享到：
