algorithm001 · JackZhangDF · Apr 20, 2019 · Apr 28, 2019 · May 5, 2019 · May 5, 2019
diff --git a/Week_01/id_10/LeetCode_20_10.c b/Week_01/id_10/LeetCode_20_10.c
@@ -0,0 +1,29 @@
+bool isValid(char* s) {
+    int length = strlen(s);
+    char* temp = (char*)malloc(length);
+    int tail = 0;
+    for (int i = 0;i < length;i++) {
+        char value = s[i];
+        if (value == '(' || value == '{' || value == '[' ) {
+            temp[tail] = value;
+            tail++;
+        }
+        else {
+            if (tail == 0) {
+                return false;
+            }
+            char now = temp[tail - 1];
+            if ((now == '(' && value == ')') || (now == '{' && value == '}') || (now == '[' && value == ']')) {
+
+            }
+            else {
+                return false;
+            }
+            tail--;
+        }
+    }
+    if (tail != 0) {
+        return false;
+    }
+    return true;
+}
diff --git a/Week_01/id_10/LeetCode_83_10.c b/Week_01/id_10/LeetCode_83_10.c
@@ -0,0 +1,36 @@
+/**
+ * Definition for singly-linked list.
+ * struct ListNode {
+ *     int val;
+ *     struct ListNode *next;
+ * };
+ */
+struct ListNode* deleteDuplicates(struct ListNode* head) {
+    if (head == NULL ||head->next == NULL) {
+        return head;
+    }
+    struct ListNode* p = head;
+    int value = p->val;
+    while(p->next != NULL) {
+        if(p->next->val == value) {
+            deleteNode(p);
+        }
+        //边界条件
+        if (p->next != NULL) {
+            if (p->next->val > value) {
+            p = p->next;
+            value = p->val;
+          }
+        }
+    }
+    return head;
+}
+//删除节点p的后继节点
+void deleteNode(struct ListNode* p) {
+    struct ListNode* q;
+    if (p->next != NULL) {
+        q = p->next;
+        p->next = q->next;  
+        q = NULL;
+    }
+}