Fine tune the C codes.

codes/c/chapter_searching/hashing_search.c

@@ -142,5 +142,6 @@ int main() {
     if (node)
         printf("目标节点值 3 的对应节点对象为 %#p val: %d\r\n", node, node->val);
     deleteAll(ht1);
+
     return 0;
 }

codes/c/chapter_searching/leetcode_two_sum.c

@@ -82,5 +82,6 @@ int main() {
     res = twoSumHashTable(nums, sizeof(nums) / sizeof(int), target, &returnSize);
     printf("方法二 res = ");
     printArray(res, returnSize);
+
     return 0;
-}
+}