feat: add solutions to lc problem: No.2481

No.2481.Minimum Cuts to Divide a Circle

Author: yanglbme

solution/2400-2499/2481.Minimum Cuts to Divide a Circle/README.md

@@ -63,6 +63,15 @@
 -   当 $n$ 为奇数时，不存在共线的情况，返回 $n$；
 -   当 $n$ 为偶数时，可以两两共线，返回 $\frac{n}{2}$。
 
+综上，可以得到：
+
+$$
+\text{ans} = \begin{cases}
+n, & n \gt 1 \text{ 且 } n \text{ 为奇数} \\
+\frac{n}{2}, & n \text{ 为其它} \\
+\end{cases}
+$$
+
 时间复杂度 $O(1)$，空间复杂度 $O(1)$。
 
 <!-- tabs:start -->
@@ -74,7 +83,7 @@
 ```python
 class Solution:
     def numberOfCuts(self, n: int) -> int:
-        return n if n > 1 and n % 2 else n >> 1
+        return n if (n > 1 and n & 1) else n >> 1
 ```
 
 ### **Java**
@@ -111,6 +120,24 @@ func numberOfCuts(n int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numberOfCuts(n: number): number {
+    return n > 1 && n & 1 ? n : n >> 1;
+}
+```
+
+### **C#**
+
+```cs
+public class Solution {
+    public int NumberOfCuts(int n) {
+        return n > 1 && n % 2 == 1 ? n : n >> 1;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2400-2499/2481.Minimum Cuts to Divide a Circle/README_EN.md

@@ -52,7 +52,7 @@ Also note that the first cut will not divide the circle into distinct parts.
 ```python
 class Solution:
     def numberOfCuts(self, n: int) -> int:
-        return n if n > 1 and n % 2 else n >> 1
+        return n if (n > 1 and n & 1) else n >> 1
 ```
 
 ### **Java**
@@ -87,6 +87,24 @@ func numberOfCuts(n int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numberOfCuts(n: number): number {
+    return n > 1 && n & 1 ? n : n >> 1;
+}
+```
+
+### **C#**
+
+```cs
+public class Solution {
+    public int NumberOfCuts(int n) {
+        return n > 1 && n % 2 == 1 ? n : n >> 1;
+    }
+}
+```
+
 ### **...**
 
 ```

solution/2400-2499/2481.Minimum Cuts to Divide a Circle/Solution.cs

@@ -0,0 +1,5 @@
+public class Solution {
+    public int NumberOfCuts(int n) {
+        return n > 1 && n % 2 == 1 ? n : n >> 1;
+    }
+}

solution/2400-2499/2481.Minimum Cuts to Divide a Circle/Solution.py

@@ -1,3 +1,3 @@
-class Solution:
-    def numberOfCuts(self, n: int) -> int:
-        return n if n > 1 and n % 2 else n >> 1
+class Solution:
+    def numberOfCuts(self, n: int) -> int:
+        return n if (n > 1 and n & 1) else n >> 1

solution/2400-2499/2481.Minimum Cuts to Divide a Circle/Solution.ts

@@ -0,0 +1,3 @@
+function numberOfCuts(n: number): number {
+    return n > 1 && n & 1 ? n : n >> 1;
+}