mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 08:21:41 +08:00
存量题库数据更新
This commit is contained in:
@@ -28,7 +28,7 @@
|
||||
<p>Return <em>the 2D array </em><code>ans</code> <em>containing the paths of the <strong>remaining</strong> folders after deleting all the marked folders. The paths may be returned in <strong>any</strong> order</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2021/07/19/lc-dupfolder1.jpg" style="width: 200px; height: 218px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> paths = [["a"],["c"],["d"],["a","b"],["c","b"],["d","a"]]
|
||||
@@ -38,7 +38,7 @@ Folders "/a" and "/c" (and their subfolders) are marked for
|
||||
folder named "b".
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2021/07/19/lc-dupfolder2.jpg" style="width: 200px; height: 355px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> paths = [["a"],["c"],["a","b"],["c","b"],["a","b","x"],["a","b","x","y"],["w"],["w","y"]]
|
||||
@@ -48,7 +48,7 @@ Folders "/a/b/x" and "/w" (and their subfolders) are marked
|
||||
Note that folders "/a" and "/c" are identical after the deletion, but they are not deleted because they were not marked beforehand.
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2021/07/19/lc-dupfolder3.jpg" style="width: 200px; height: 201px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> paths = [["a","b"],["c","d"],["c"],["a"]]
|
||||
|
Reference in New Issue
Block a user