Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Create 1640.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2022-09-22 08:55:42 +08:00 committed by GitHub
parent 915867e8f7
commit c88ede9274
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 37 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
LeetCode/1640.cpp Normal file
View File

@ -0,0 +1,37 @@
class Solution {
public:
bool stepSearch(vector<int>& arr, vector<vector<int>>& pieces, vector<bool>& visited, int startIndex) {
for (int i = 0; i < pieces.size(); i++)
{
if (visited[i]) continue;
if (pieces[i][0] != arr[startIndex]) continue;
if (startIndex + pieces[i].size() > arr.size()) continue;
// check all elements
int j = 1;
for (; j < pieces[i].size(); j++) {
if (arr[startIndex + j] != pieces[i][j]) break;
}
if (j != pieces[i].size()) {
continue;
}
if (arr.size() == startIndex + pieces[i].size()) return true;
// step down
visited[i] = true;
bool ret = stepSearch(arr, pieces, visited, startIndex + pieces[i].size());
visited[i] = false;
if (ret) return true;
}
return false;
}
bool canFormArray(vector<int>& arr, vector<vector<int>>& pieces) {
vector<bool> visited(pieces.size(), false);
return stepSearch(arr, pieces, visited, 0);
}
};