Use __typeof for compile compatibility

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

0030_substring_with_concatenation_of_all_words/concatenation.c

@@ -11,9 +11,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c

@@ -9,9 +9,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c

@@ -9,9 +9,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0123_best_time_to_buy_and_sell_stock_iii/stock.c

@@ -53,7 +53,7 @@ static int maxProfit(int* prices, int pricesSize)
     int total = left_profit[pricesSize - 1];
     for (i = pricesSize - 2; i >= 0; i--) {
         if (prices[i] > max) {
-             max = prices[i];
+            max = prices[i];
         } else {
             tmp = max - prices[i];
             right_profit = tmp > right_profit ? tmp : right_profit;

0126_word_ladder_ii/word_ladder.c

@@ -13,9 +13,9 @@
 #define list_first_entry(ptr, type, field)  list_entry((ptr)->next, type, field)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0127_word_ladder/word_ladder.c

@@ -12,9 +12,9 @@
 #define list_first_entry(ptr, type, field)  list_entry((ptr)->next, type, field)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0128_longest_consecutive_sequence/consec_seq.c

@@ -9,9 +9,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0133_clone_graph/clone_graph.c

@@ -9,9 +9,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0140_word_break_ii/word_break.c

@@ -10,9 +10,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0146_lru_cache/lru_cache.c

@@ -11,15 +11,15 @@
 #define	list_last_entry(ptr, type, field)  list_entry((ptr)->prev, type, field)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 #define list_for_each_entry_safe(pos, n, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member), \
-         n = list_entry(pos->member.next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member), \
+         n = list_entry(pos->member.next, __typeof(*pos), member); \
          &pos->member != (head); \
-         pos = n, n = list_entry(n->member.next, typeof(*n), member))
+         pos = n, n = list_entry(n->member.next, __typeof(*n), member))
 
 struct list_head {
     struct list_head *next, *prev;

0149_max_points_on_a_line/points_on_line.c

@@ -11,9 +11,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0166_fraction_to_recurring_decimal/fraction.c

@@ -11,9 +11,9 @@
     container_of(ptr, type, member)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 struct list_head {
     struct list_head *next, *prev;

0460_lfu_cache/lfu_cache.c

@@ -13,15 +13,15 @@
 #define list_last_entry(ptr, type, field)  list_entry((ptr)->prev, type, field)
 
 #define list_for_each_entry(pos, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member); \
          &(pos)->member != (head); \
-         pos = list_entry((pos)->member.next, typeof(*pos), member))
+         pos = list_entry((pos)->member.next, __typeof(*pos), member))
 
 #define list_for_each_entry_safe(pos, n, head, member) \
-    for (pos = list_entry((head)->next, typeof(*pos), member), \
-         n = list_entry(pos->member.next, typeof(*pos), member); \
+    for (pos = list_entry((head)->next, __typeof(*pos), member), \
+         n = list_entry(pos->member.next, __typeof(*pos), member); \
          &pos->member != (head); \
-         pos = n, n = list_entry(n->member.next, typeof(*n), member))
+         pos = n, n = list_entry(n->member.next, __typeof(*n), member))
 
 struct list_head {
     struct list_head *next, *prev;