From 2d266b576653720ff16b0a3dfa635b72f5ffa57d Mon Sep 17 00:00:00 2001
From: liao junwu <andyliaowu5@163.com>
Date: Thu, 14 Nov 2024 23:24:17 +0800
Subject: [PATCH 1/2] [0739 temperature] add C version

add C version for 0739: temperature

Signed-off-by: liao junwu <andyliaowu5@163.com>
---
 problems/0739.每日温度.md | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)

diff --git a/problems/0739.每日温度.md b/problems/0739.每日温度.md
index 45af5286..dd633aed 100644
--- a/problems/0739.每日温度.md
+++ b/problems/0739.每日温度.md
@@ -215,6 +215,38 @@ public:
 
 ## 其他语言版本
 
+### C：
+
+```C
+/**
+ * Note: The returned array must be malloced, assume caller calls free().
+ */
+int* dailyTemperatures(int* temperatures, int temperaturesSize, int* returnSize) {
+    int len = temperaturesSize;
+    *returnSize = len;
+
+    int *result = (int *)malloc(sizeof(int) * len);
+    memset(result, 0x00, sizeof(int) * len);
+
+    int stack[len];
+    memset(stack, 0x00, sizeof(stack));
+    int top = 0;
+
+    for (int i = 1; i < len; i++) {
+        if (temperatures[i] <= temperatures[stack[top]]) { /* push */
+            stack[++top] = i;
+        } else {
+            while (top >= 0 && temperatures[i] > temperatures[stack[top]]) { /* stack not empty */
+                result[stack[top]] = i - stack[top];
+                top--; /* pop */
+            }
+            stack[++top] = i; /* push */
+        }
+    }
+    return result;
+}
+```
+
 ### Java：
 
 ```java

From da88f5e4c1407d99b46f087a6d5d10f6e685844e Mon Sep 17 00:00:00 2001
From: liao junwu <andyliaowu5@163.com>
Date: Sat, 16 Nov 2024 15:42:44 +0800
Subject: [PATCH 2/2] [0496 the next bigger element] add C version

add C version for 0496: the next bigger element

Signed-off-by: liao junwu <andyliaowu5@163.com>
---
 problems/0496.下一个更大元素I.md | 56 +++++++++++++++++++++++++
 1 file changed, 56 insertions(+)

diff --git a/problems/0496.下一个更大元素I.md b/problems/0496.下一个更大元素I.md
index 54182d30..02e73a58 100644
--- a/problems/0496.下一个更大元素I.md
+++ b/problems/0496.下一个更大元素I.md
@@ -195,6 +195,62 @@ public:
 建议大家把情况一二三想清楚了，先写出版本一的代码，然后在其基础上在做精简！
 
 ## 其他语言版本
+
+### C
+
+``` C
+/* 先用单调栈的方法计算出结果，再根据nums1中的元素去查找对应的结果 */
+/**
+ * Note: The returned array must be malloced, assume caller calls free().
+ */
+int* nextGreaterElement(int* nums1, int nums1Size, int* nums2, int nums2Size, int* returnSize) {
+
+    /* stcak */
+    int top = -1;
+    int stack_len = nums2Size;
+    int stack[stack_len];
+    //memset(stack, 0x00, sizeof(stack));
+
+    /* nums2 result */
+    int* result_nums2 = (int *)malloc(sizeof(int) * nums2Size);
+    //memset(result_nums2, 0x00, sizeof(int) * nums2Size);
+
+    /* result */
+    int* result = (int *)malloc(sizeof(int) * nums1Size);
+    //memset(result, 0x00, sizeof(int) * nums1Size);
+    *returnSize = nums1Size;
+
+    /* init */
+    stack[++top] = 0; /* stack loaded with array subscripts */
+
+    for (int i = 0; i < nums2Size; i++) {
+        result_nums2[i] = -1;
+    }
+
+    /* get the result_nums2 */
+    for (int i = 1; i < nums2Size; i++) {
+        if (nums2[i] <= nums2[stack[top]]) {
+            stack[++top] = i; /* push */
+        } else {
+            while ((top >= 0) && (nums2[i] > nums2[stack[top]])) {
+                result_nums2[stack[top]] = nums2[i];
+                top--; /* pop */
+            }
+            stack[++top] = i;
+        }
+    }
+
+    /* get the result */
+    for (int i = 0; i < nums1Size; i++) {
+        for (int j = 0; j < nums2Size; j++) {
+            if (nums1[i] == nums2[j]) {
+                result[i] = result_nums2[j];
+            }
+        }
+    }
+    return result;
+}
+```
 ### Java
 
 ```java