Merge branch 'doocs:main' into main

Author: Nothing-avil

images/starcharts.svg

@@ -177,10 +177,10 @@ class Solution {
         if maxVat == 0 {
             return 0
         }
-        
+
         let n = vat.count
         var ans = Int.max
-        
+
         for x in 1...maxVat {
             var y = 0
             for i in 0..<n {
@@ -190,7 +190,7 @@ class Solution {
             }
             ans = min(ans, x + y)
         }
-        
+
         return ans
     }
 }

lcp/LCP 33. 蓄水/README.md

@@ -242,22 +242,22 @@ var maxValue = function (root, k) {
 
 class Solution {
     private var k: Int = 0
-    
+
     func maxValue(_ root: TreeNode?, _ k: Int) -> Int {
         self.k = k
         return dfs(root).max() ?? 0
     }
-    
+
     private func dfs(_ root: TreeNode?) -> [Int] {
         var ans = [Int](repeating: 0, count: k + 1)
         guard let root = root else {
             return ans
         }
         let l = dfs(root.left)
         let r = dfs(root.right)
-        
+
         ans[0] = (l.max() ?? 0) + (r.max() ?? 0)
-        
+
         for i in 0..<k {
             for j in 0..<k - i {
                 ans[i + j + 1] = max(ans[i + j + 1], root.val + l[i] + r[j])

lcp/LCP 34. 二叉树染色/README.md

@@ -299,13 +299,13 @@ class Solution {
     private var m = 0
     private var n = 0
     private var chessboard: [String] = []
-    
+
     func flipChess(_ chessboard: [String]) -> Int {
         self.m = chessboard.count
         self.n = chessboard[0].count
         self.chessboard = chessboard
         var ans = 0
-        
+
         for i in 0..<m {
             for j in 0..<n {
                 if Array(chessboard[i])[j] == "." {
@@ -315,32 +315,32 @@ class Solution {
         }
         return ans
     }
-    
+
     private func bfs(_ i: Int, _ j: Int) -> Int {
         var queue: [[Int]] = [[i, j]]
         var g = chessboard.map { Array($0) }
         g[i][j] = "X"
         var count = 0
-        
+
         while !queue.isEmpty {
             let p = queue.removeFirst()
             let i = p[0], j = p[1]
-            
+
             for a in -1...1 {
                 for b in -1...1 {
                     if a == 0 && b == 0 { continue }
-                    
+
                     var x = i + a, y = j + b
                     while x >= 0 && x < m && y >= 0 && y < n && g[x][y] == "O" {
                         x += a
                         y += b
                     }
-                    
+
                     if x >= 0 && x < m && y >= 0 && y < n && g[x][y] == "X" {
                         x -= a
                         y -= b
                         count += max(abs(x - i), abs(y - j))
-                        
+
                         while x != i || y != j {
                             g[x][y] = "X"
                             queue.append([x, y])

lcp/LCP 41. 黑白翻转棋/README.md

@@ -176,12 +176,12 @@ func dfs(root *TreeNode) {
 
 class Solution {
     private var uniqueColors: Set<Int> = []
-    
+
     func numColor(_ root: TreeNode?) -> Int {
         dfs(root)
         return uniqueColors.count
     }
-    
+
     private func dfs(_ node: TreeNode?) {
         guard let node = node else { return }
         uniqueColors.insert(node.val)

lcp/LCP 44. 开幕式焰火/README.md

@@ -160,14 +160,14 @@ function giveGem(gem: number[], operations: number[][]): number {
 class Solution {
     func giveGem(_ gem: [Int], _ operations: [[Int]]) -> Int {
         var gem = gem
-        
+
         for op in operations {
             let x = op[0], y = op[1]
             let v = gem[x] / 2
             gem[y] += v
             gem[x] -= v
         }
-        
+
         let maxGem = gem.max() ?? 0
         let minGem = gem.min() ?? 0
         return maxGem - minGem

lcp/LCP 50. 宝石补给/README.md

@@ -302,6 +302,25 @@ def two_sum(nums, target)
 end
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun twoSum(nums: IntArray, target: Int): IntArray {
+        val m = mutableMapOf<Int, Int>()
+        nums.forEachIndexed { i, x ->
+            val y = target - x
+            val j = m.get(y)
+            if (j != null) {
+                return intArrayOf(j, i)
+            }
+            m[x] = i
+        }
+        return intArrayOf()
+    }
+}
+```
+
 #### Nim
 
 ```nim
@@ -318,21 +337,19 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
   return @[]
 ```
 
-#### Kotlin
+#### Cangjie
 
-```kotlin
+```cj
 class Solution {
-    fun twoSum(nums: IntArray, target: Int): IntArray {
-        val m = mutableMapOf<Int, Int>()
-        nums.forEachIndexed { i, x ->
-            val y = target - x
-            val j = m.get(y)
-            if (j != null) {
-                return intArrayOf(j, i)
+    func twoSum(nums: Array<Int64>, target: Int64): Array<Int64> {
+        let d = HashMap<Int64, Int64>()
+        for (i in 0..nums.size) {
+            if (d.contains(target - nums[i])) {
+                return [d[target - nums[i]], i]
             }
-            m[x] = i
+            d[nums[i]] = i
         }
-        return intArrayOf()
+        []
     }
 }
 ```

solution/0000-0099/0001.Two Sum/README.md

@@ -299,6 +299,25 @@ def two_sum(nums, target)
 end
 ```
 
+#### Kotlin
+
+```kotlin
+class Solution {
+    fun twoSum(nums: IntArray, target: Int): IntArray {
+        val m = mutableMapOf<Int, Int>()
+        nums.forEachIndexed { i, x ->
+            val y = target - x
+            val j = m.get(y)
+            if (j != null) {
+                return intArrayOf(j, i)
+            }
+            m[x] = i
+        }
+        return intArrayOf()
+    }
+}
+```
+
 #### Nim
 
 ```nim
@@ -315,21 +334,19 @@ proc twoSum(nums: seq[int], target: int): seq[int] =
   return @[]
 ```
 
-#### Kotlin
+#### Cangjie
 
-```kotlin
+```cj
 class Solution {
-    fun twoSum(nums: IntArray, target: Int): IntArray {
-        val m = mutableMapOf<Int, Int>()
-        nums.forEachIndexed { i, x ->
-            val y = target - x
-            val j = m.get(y)
-            if (j != null) {
-                return intArrayOf(j, i)
+    func twoSum(nums: Array<Int64>, target: Int64): Array<Int64> {
+        let d = HashMap<Int64, Int64>()
+        for (i in 0..nums.size) {
+            if (d.contains(target - nums[i])) {
+                return [d[target - nums[i]], i]
             }
-            m[x] = i
+            d[nums[i]] = i
         }
-        return intArrayOf()
+        []
     }
 }
 ```

solution/0000-0099/0001.Two Sum/README_EN.md

@@ -0,0 +1,12 @@
+class Solution {
+    func twoSum(nums: Array<Int64>, target: Int64): Array<Int64> {
+        let d = HashMap<Int64, Int64>()
+        for (i in 0..nums.size) {
+            if (d.contains(target - nums[i])) {
+                return [d[target - nums[i]], i]
+            }
+            d[nums[i]] = i
+        }
+        []
+    }
+}

solution/0000-0099/0001.Two Sum/Solution.cj

@@ -21,38 +21,55 @@ tags:
 
 <p>给定一个二叉树的 <strong>根节点</strong> <code>root</code>，想象自己站在它的右侧，按照从顶部到底部的顺序，返回从右侧所能看到的节点值。</p>
 
-<p> </p>
+<p>&nbsp;</p>
 
-<p><strong>示例 1:</strong></p>
+<p><strong class="example">示例 1：</strong></p>
 
-<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tree.jpg" style="width: 270px; " /></p>
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>root = [1,2,3,null,5,null,4]</span></p>
 
-<pre>
-<strong>输入:</strong> [1,2,3,null,5,null,4]
-<strong>输出:</strong> [1,3,4]
-</pre>
+<p><strong>输出：</strong><span class="example-io">[1,3,4]</span></p>
 
-<p><strong>示例 2:</strong></p>
+<p><strong>解释：</strong></p>
 
-<pre>
-<strong>输入:</strong> [1,null,3]
-<strong>输出:</strong> [1,3]
-</pre>
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tmpd5jn43fs-1.png" style="width: 400px; height: 207px;" /></p>
+</div>
 
-<p><strong>示例 3:</strong></p>
+<p><strong class="example">示例 2：</strong></p>
 
-<pre>
-<strong>输入:</strong> []
-<strong>输出:</strong> []
-</pre>
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>root = [1,2,3,4,null,null,null,5]</span></p>
 
-<p> </p>
+<p><span class="example-io"><b>输出：</b>[1,3,4,5]</span></p>
+
+<p><strong>解释：</strong></p>
+
+<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0100-0199/0199.Binary%20Tree%20Right%20Side%20View/images/tmpkpe40xeh-1.png" style="width: 400px; height: 214px;" /></p>
+</div>
+
+<p><strong class="example">示例 3：</strong></p>
+
+<div class="example-block">
+<p><strong>输入：</strong><span class="example-io">root = [1,null,3]</span></p>
+
+<p><strong>输出：</strong><span class="example-io">[1,3]</span></p>
+</div>
+
+<p><strong class="example">示例 4：</strong></p>
+
+<div class="example-block">
+<p><span class="example-io"><b>输入：</b>root = []</span></p>
+
+<p><strong>输出：</strong><span class="example-io">[]</span></p>
+
+<p>&nbsp;</p>
+</div>
 
 <p><strong>提示:</strong></p>
 
 <ul>
 	<li>二叉树的节点个数的范围是 <code>[0,100]</code></li>
-	<li><meta charset="UTF-8" /><code>-100 <= Node.val <= 100</code> </li>
+	<li><meta charset="UTF-8" /><code>-100&nbsp;&lt;= Node.val &lt;= 100</code>&nbsp;</li>
 </ul>
 
 <!-- description:end -->