crawler log problem

Author: bamblebam

leetcode/weekly contest problems/crawler_log_folder.py

@@ -0,0 +1,29 @@
+from typing import List
+# 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 ith 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.
+
+
+class Solution:
+    def minOperations(self, logs: List[str]) -> int:
+        count = 0
+        for operation in logs:
+            if operation == './':
+                continue
+            elif operation == '../':
+                if count != 0:
+                    count -= 1
+                else:
+                    continue
+            else:
+                count += 1
+        return max(count, 0)

leetcode/weekly contest problems/special_array_with_X_elements_greater_than_X.py

@@ -1,4 +1,9 @@
 from typing import List
+# You are given an array nums of non-negative integers. nums is considered special if there exists a number x such that there are exactly x numbers in nums that are greater than or equal to x.
+
+# Notice that x does not have to be an element in nums.
+
+# Return x if the array is special, otherwise, return -1. It can be proven that if nums is special, the value for x is unique.
 
 
 class Solution: