feat: add cangjie solution to lc problem: No.0001

Author: yanglbme

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

@@ -302,22 +302,6 @@ def two_sum(nums, target)
 end
 ```
 
-#### Nim
-
-```nim
-import std/enumerate
-import std/tables
-
-proc twoSum(nums: seq[int], target: int): seq[int] =
-  var d = initTable[int, int]()
-  for i, x in nums.pairs():
-    let y = target - x
-    if d.hasKey(y):
-      return @[d[y], i]
-    d[x] = i
-  return @[]
-```
-
 #### Kotlin
 
 ```kotlin
@@ -337,6 +321,39 @@ class Solution {
 }
 ```
 
+#### Cangjie
+
+```cj
+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
+        }
+        []
+    }
+}
+```
+
+#### Nim
+
+```nim
+import std/enumerate
+import std/tables
+
+proc twoSum(nums: seq[int], target: int): seq[int] =
+  var d = initTable[int, int]()
+  for i, x in nums.pairs():
+    let y = target - x
+    if d.hasKey(y):
+      return @[d[y], i]
+    d[x] = i
+  return @[]
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -299,22 +299,6 @@ def two_sum(nums, target)
 end
 ```
 
-#### Nim
-
-```nim
-import std/enumerate
-import std/tables
-
-proc twoSum(nums: seq[int], target: int): seq[int] =
-  var d = initTable[int, int]()
-  for i, x in nums.pairs():
-    let y = target - x
-    if d.hasKey(y):
-      return @[d[y], i]
-    d[x] = i
-  return @[]
-```
-
 #### Kotlin
 
 ```kotlin
@@ -334,6 +318,39 @@ class Solution {
 }
 ```
 
+#### Cangjie
+
+```cj
+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
+        }
+        []
+    }
+}
+```
+
+#### Nim
+
+```nim
+import std/enumerate
+import std/tables
+
+proc twoSum(nums: seq[int], target: int): seq[int] =
+  var d = initTable[int, int]()
+  for i, x in nums.pairs():
+    let y = target - x
+    if d.hasKey(y):
+      return @[d[y], i]
+    d[x] = i
+  return @[]
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

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

@@ -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
+        }
+        []
+    }
+}