algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 15:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix：调整间距

Browse Source
This commit is contained in:
Chemxy
2024-09-13 23:08:46 +08:00
parent d742497b52
commit 8b90ac06bf
3 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0674.最长连续递增序列.md
View File

@ -491,7 +491,9 @@ int findLengthOfLCIS(int* nums, int numsSize) {
return result;
}
```
### Cangjie
```cangjie
func findLengthOfLCIS(nums: Array<Int64>): Int64 {
let n = nums.size

1
problems/0718.最长重复子数组.md
View File

@ -582,6 +582,7 @@ int findLength(int* nums1, int nums1Size, int* nums2, int nums2Size) {
```
### Cangjie
```cangjie
func findLength(nums1: Array<Int64>, nums2: Array<Int64>): Int64 {
let n = nums1.size

1
problems/1143.最长公共子序列.md
View File

@ -400,6 +400,7 @@ int longestCommonSubsequence(char* text1, char* text2) {
```
### Cangjie
```cangjie
func longestCommonSubsequence(text1: String, text2: String): Int64 {
let n = text1.size