diff --git a/problems/0674.最长连续递增序列.md b/problems/0674.最长连续递增序列.md
index 485e321c..ece62944 100644
--- a/problems/0674.最长连续递增序列.md
+++ b/problems/0674.最长连续递增序列.md
@@ -425,6 +425,57 @@ function findLengthOfLCIS(nums: number[]): number {
 };
 ```
 
+### C：
+
+> 动态规划：
+
+```c
+int findLengthOfLCIS(int* nums, int numsSize) {
+    if(numsSize == 0){
+        return 0;
+    }
+    int dp[numsSize];
+    for(int i = 0; i < numsSize; i++){
+        dp[i] = 1;
+    }
+    int result = 1;
+    for (int i = 1; i < numsSize; ++i) {
+        if(nums[i] > nums[i - 1]){
+            dp[i] = dp[i - 1] + 1;
+        }
+        if(dp[i] > result){
+            result = dp[i];
+        }
+    }
+    return result;
+}
+```
+
+
+
+> 贪心:
+
+```c
+int findLengthOfLCIS(int* nums, int numsSize) {
+    int result = 1;
+    int count = 1;
+    if(numsSize == 0){
+        return result;
+    }
+    for (int i = 1; i < numsSize; ++i) {
+        if(nums[i] > nums[i - 1]){
+            count++;
+        } else{
+            count = 1;
+        }
+        if(count > result){
+            result = count;
+        }
+    }
+    return result;
+}
+```
+
 
 
 
@@ -432,4 +483,3 @@ function findLengthOfLCIS(nums: number[]): number {
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
 </a>
-