看到idea还以为是java代码，白高兴一场QAQ，没事，等会java佬帮你看看
by Molie @ 2023-06-17 21:43:01
这是我的代码主要逻辑（特别判断了1，然后向上找队列长度个单位，然后向左找对应队列长度个单位）
```
int ans = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (arr[i][j] == '.' && count == 1) {
ans++;
continue;
}
if (arr[i][j] == '.') {
//上边几个
int k = count;
for (int index = i; index >= 0; index--) {
if (arr[index][j] != '.') break;
k--;
}
if (k <= 0) ans++;
//枚举左边
k = count;
for (int index = j; index >= 0; index--) {
if (arr[i][index] != '.') break;
k--;
}
if (k <= 0) ans++;
}
}
}
```
by Molie @ 2023-06-17 22:11:25