feat: update leetcode solutions: No.1006. Clumsy Factorial

Author: yanglbme

solution/1000-1099/1006.Clumsy Factorial/README.md

@@ -44,22 +44,61 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+遇到 `*`、`/` 时计算后入栈，遇到 `+`、`-` 时直接入栈。最后累加栈中的元素即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def clumsy(self, N: int) -> int:
+        op = 0
+        s = [N]
+        for i in range(N - 1, 0, -1):
+            if op == 0:
+                s.append(s.pop() * i)
+            elif op == 1:
+                s.append(int(s.pop() / i))
+            elif op == 2:
+                s.append(i)
+            else:
+                s.append(-i)
+            op = (op + 1) % 4
+        return sum(s)
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int clumsy(int N) {
+        Deque<Integer> s = new ArrayDeque<>();
+        s.offerLast(N);
+        int op = 0;
+        for (int i = N - 1; i > 0; --i) {
+            if (op == 0) {
+                s.offerLast(s.pollLast() * i);
+            } else if (op == 1) {
+                s.offerLast(s.pollLast() / i);
+            } else if (op == 2) {
+                s.offerLast(i);
+            } else {
+                s.offerLast(-i);
+            }
+            op = (op + 1) % 4;
+        }
+        int res = 0;
+        while (!s.isEmpty()) {
+            res += s.pollLast();
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/1000-1099/1006.Clumsy Factorial/README_EN.md

@@ -56,13 +56,50 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def clumsy(self, N: int) -> int:
+        op = 0
+        s = [N]
+        for i in range(N - 1, 0, -1):
+            if op == 0:
+                s.append(s.pop() * i)
+            elif op == 1:
+                s.append(int(s.pop() / i))
+            elif op == 2:
+                s.append(i)
+            else:
+                s.append(-i)
+            op = (op + 1) % 4
+        return sum(s)
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public int clumsy(int N) {
+        Deque<Integer> s = new ArrayDeque<>();
+        s.offerLast(N);
+        int op = 0;
+        for (int i = N - 1; i > 0; --i) {
+            if (op == 0) {
+                s.offerLast(s.pollLast() * i);
+            } else if (op == 1) {
+                s.offerLast(s.pollLast() / i);
+            } else if (op == 2) {
+                s.offerLast(i);
+            } else {
+                s.offerLast(-i);
+            }
+            op = (op + 1) % 4;
+        }
+        int res = 0;
+        while (!s.isEmpty()) {
+            res += s.pollLast();
+        }
+        return res;
+    }
+}
 ```
 
 ### **...**

solution/1000-1099/1006.Clumsy Factorial/Solution.java

@@ -0,0 +1,24 @@
+class Solution {
+    public int clumsy(int N) {
+        Deque<Integer> s = new ArrayDeque<>();
+        s.offerLast(N);
+        int op = 0;
+        for (int i = N - 1; i > 0; --i) {
+            if (op == 0) {
+                s.offerLast(s.pollLast() * i);
+            } else if (op == 1) {
+                s.offerLast(s.pollLast() / i);
+            } else if (op == 2) {
+                s.offerLast(i);
+            } else {
+                s.offerLast(-i);
+            }
+            op = (op + 1) % 4;
+        }
+        int res = 0;
+        while (!s.isEmpty()) {
+            res += s.pollLast();
+        }
+        return res;
+    }
+}

solution/1000-1099/1006.Clumsy Factorial/Solution.py

@@ -1,13 +1,15 @@
 class Solution:
-
     def clumsy(self, N: int) -> int:
-        s = ''
-        calc = ['*', '//', '+', '-']
-        i = 0
-        while N != 1:
-            s = s + str(N) + calc[i]
-            i += 1
-            i %= 4
-            N -= 1
-        s += '1'
-        return eval(s)
+        op = 0
+        s = [N]
+        for i in range(N - 1, 0, -1):
+            if op == 0:
+                s.append(s.pop() * i)
+            elif op == 1:
+                s.append(int(s.pop() / i))
+            elif op == 2:
+                s.append(i)
+            else:
+                s.append(-i)
+            op = (op + 1) % 4
+        return sum(s)