Skip to content

[pull] master from begeekmyfriend:master #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 27, 2023
Merged

[pull] master from begeekmyfriend:master #5

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions 0030_substring_with_concatenation_of_all_words/concatenation.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0105_construct_binary_tree_from_preorder_and_inorder_traversal/binary_tree_build.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
2 changes: 1 addition & 1 deletion 0123_best_time_to_buy_and_sell_stock_iii/stock.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0126_word_ladder_ii/word_ladder.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0127_word_ladder/word_ladder.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0128_longest_consecutive_sequence/consec_seq.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0133_clone_graph/clone_graph.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0140_word_break_ii/word_break.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
10 changes: 5 additions & 5 deletions 0146_lru_cache/lru_cache.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0149_max_points_on_a_line/points_on_line.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
4 changes: 2 additions & 2 deletions 0166_fraction_to_recurring_decimal/fraction.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
10 changes: 5 additions & 5 deletions 0460_lfu_cache/lfu_cache.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down