refresh

du6/list_ops.c

@@ -67,7 +67,7 @@ list_t *filter_list(list_t *list, bool (*filter)(list_element_t)) {
     size_t j = 0;
     for (size_t i = 0; i < list->length; i++) {
         if (filter(list->elements[i])) {
-            new->elements[j+] = list->elements[i];
+            new->elements[j++] = list->elements[i];
         }
     }
 
@@ -112,11 +112,12 @@ list_t *reverse_list(list_t *lst) {
 
     size_t n = lst->length;
     list_t *reversed = malloc(sizeof(list_t) + n * sizeof(list_element_t));
-    if (!reversed) return NULL;
-
+    if (!reversed) { 
+        return NULL;
+    }
     reversed->length = n;
 
-    for (size_t i = 0; i < n; ++i) {
+    for (size_t i = 1; i < n; ++i) {
         reversed->elements[i] = lst->elements[n - i - 1];
     }