Crawler Log Folder

The Leetcode file system keeps a log each time some user performs a change folder operation.

The operations are described below:

  • "../": Move to the parent folder of the current folder. If you are already in the main folder, remain in the same folder.
  • "./": Remain in the same folder.
  • "x/": Move to the child folder named x. This folder is guaranteed to always exist.

You are given a list of strings logs where logs[i] is the operation performed by the user at the i^th step.

The file system starts in the main folder, then the operations in logs are performed.

Return the minimum number of operations needed to go back to the main folder after the change folder operations.

Example 1
Inputlogs = ["d1/","d2/","../","d21/","./"]
Output2
Use the change folder operation "../" 2 times to go back to the main folder.
Example 2
Inputlogs = ["d1/","d2/","./","d3/","../","d31/"]
Output3
After all operations, the current folder is 3 levels below the main folder, so 3 parent-folder operations are needed.

Constraints

  • 1 <= logs.length <= 10^3
  • 2 <= logs[i].length <= 10
  • logs[i] contains lowercase English letters, digits, '.', and '/'.
  • logs[i] follows the format described in the statement.
  • Folder names consist of lowercase English letters and digits.

Asked at 3 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate