Skip to content

Commit 6d86ce5

Browse files
authored
Create Readme.md
1 parent 6b59d37 commit 6d86ce5

File tree

1 file changed

+5
-0
lines changed
  • BFS/3690.Split-and-Merge-Array-Transformation

1 file changed

+5
-0
lines changed
Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,5 @@
1+
### 3690.Split-and-Merge-Array-Transformation
2+
3+
本题的数据量不大,数组元素数目很少,可以暴力(配合去重)。因为是求最少变换次数,显然选用BFS。
4+
5+
每次从队列里弹出一个数组,遍历所有的subarray作为sub,剩下的拼接为rem。然后在rem的任意位置插入sub,组成新的数组。

0 commit comments

Comments
 (0)