algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Format the C code in Clang-Format Style: Microsoft

Browse Source
This commit is contained in:
krahets
2023-04-17 21:13:15 +08:00
parent 1d6b7a5644
commit 9a98ff8a5e
46 changed files with 215 additions and 216 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
codes/c/chapter_computational_complexity/space_complexity.c
View File

@@ -17,7 +17,7 @@ void constant(int n) {
const int a = 0;
int b = 0;
int nums[1000];
ListNode* node = newListNode(0);
ListNode *node = newListNode(0);
free(node);
// 循环中的变量占用 O(1) 空间
for (int i = 0; i < n; i++) {
@@ -38,11 +38,11 @@ typedef struct {
/* 线性阶 */
void linear(int n) {
// 长度为 n 的数组占用 O(n) 空间
int *nums = malloc (sizeof(int) * n);
int *nums = malloc(sizeof(int) * n);
free(nums);
// 长度为 n 的列表占用 O(n) 空间
ListNode** nodes = malloc(sizeof(ListNode *) * n);
ListNode **nodes = malloc(sizeof(ListNode *) * n);
for (int i = 0; i < n; i++) {
nodes[i] = newListNode(i);
}
@@ -56,7 +56,7 @@ void linear(int n) {
hashTable *h = NULL;
for (int i = 0; i < n; i++) {
hashTable *tmp = malloc(sizeof (hashTable));
hashTable *tmp = malloc(sizeof(hashTable));
tmp->key = i;
sprintf(tmp->val, "%d", i);
HASH_ADD_INT(h, key, tmp);
@@ -81,7 +81,7 @@ void linearRecur(int n) {
/* 平方阶 */
void quadratic(int n) {
// 二维列表占用 O(n^2) 空间
int** numMatrix = malloc(sizeof(int *) * n);
int **numMatrix = malloc(sizeof(int *) * n);
for (int i = 0; i < n; i++) {
int *tmp = malloc(sizeof(int) * n);
for (int j = 0; j < n; j++) {
@@ -100,8 +100,8 @@ void quadratic(int n) {
/* 平方阶（递归实现） */
int quadraticRecur(int n) {
if (n <= 0)
return 0;
int* nums = malloc(sizeof(int) * n);
return 0;
int *nums = malloc(sizeof(int) * n);
printf("递归 n = %d 中的 nums 长度 = %d\r\n", n, n);
free(nums);
return quadraticRecur(n - 1);