We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 6b59d37 commit 6d86ce5Copy full SHA for 6d86ce5
BFS/3690.Split-and-Merge-Array-Transformation/Readme.md
@@ -0,0 +1,5 @@
1
+### 3690.Split-and-Merge-Array-Transformation
2
+
3
+本题的数据量不大,数组元素数目很少,可以暴力(配合去重)。因为是求最少变换次数,显然选用BFS。
4
5
+每次从队列里弹出一个数组,遍历所有的subarray作为sub,剩下的拼接为rem。然后在rem的任意位置插入sub,组成新的数组。
0 commit comments