new ：新增Cangjie解题代码

problems/0300.最长上升子序列.md

@@ -337,6 +337,29 @@ pub fn length_of_lis(nums: Vec<i32>) -> i32 {
 }
 ```
 
+### Cangjie:
+
+```cangjie
+func lengthOfLIS(nums: Array<Int64>): Int64 {
+    let n = nums.size
+    if (n <= 1) {
+        return n
+    }
+
+    let dp = Array(n, item: 1)
+    var res = 0
+    for (i in 1..n) {
+        for (j in 0..i) {
+            if (nums[i] > nums[j]) {
+                dp[i] = max(dp[i], dp[j] + 1)
+            }
+        }
+        res = max(dp[i], res)
+    }
+    return res
+}
+```
+
 
 <p align="center">
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">