leetcode

Leetcode Solutions (0x6A73)
git clone https://git.pngu.org/leetcode
Log | Files | Refs | Submodules | README

leetcode.h (1611B)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#pragma once

#include "lib/uthash/src/uthash.h"
#include <assert.h>
#include <ctype.h>
#include <limits.h>
#include <math.h>
#include <pthread.h>
#include <stdbool.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct two_d_arr {
  int row_size;
  int *col_size;
  int **arr;
};

struct ListNode {
  int val;
  struct ListNode *next;
};

struct TreeNode {
  int val;
  struct TreeNode *left;
  struct TreeNode *right;
};

struct Node {
  int val;
  int numChildren;
  struct Node **children;
};

struct two_d_arr *two_d_arr_init(int row_size, int col_size,
                                 int arr[row_size][col_size]);
void two_d_arr_free(struct two_d_arr *obj);

struct ListNode *listnode_create(int val);
struct ListNode *listnode_build(int *vals, int size);
void listnode_print(struct ListNode *head, int *expected);
void listnode_free(struct ListNode *head);

struct TreeNode *treenode_create(int val);
struct TreeNode *treenode_build(int *vals, int size);
void treenode_print(struct TreeNode *root);
void treenode_free(struct TreeNode *root);

struct Node *node_create(int val, int numChildren);
void node_print(struct Node *root, int depth);
void node_free(struct Node *root);

#define IS_ARRAY(value)                                                        \
  (!__builtin_types_compatible_p(typeof((value)), typeof(&(value)[0])))

#define ARRAY_SIZE(array)                                                      \
  (__builtin_choose_expr(IS_ARRAY((array)),                                    \
                         sizeof((array)) / sizeof((array)[0]), (void)0))