Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
29 lines (24 loc) · 669 Bytes

File metadata and controls

29 lines (24 loc) · 669 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
//
// Solution130.cpp
// Algorithm
//
// Created by Pancf on 2020/12/20.
// Copyright © 2020 Pancf. All rights reserved.
//
#include "Solution130.hpp"
static std::vector<std::pair<int, int>> pathInsideBoard(std::vector<std::vector<char>> &board, int x, int y)
{
}
void Solution130::solve(std::vector<std::vector<char>> &board)
{
int row = (int)board.size();
int col = row;
for (int i = 0; i < row; ++i) {
for (int j = 0; j < col; ++j) {
if (board[i][j] == 'O') {
// search path to border
// if has no path to border, flip all cell in the path
}
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.