Rename

Signed-off-by: begeekmyfriend <[email protected]>
kran · Jul 11, 2017 · 0a8d29d · 0a8d29d
1 parent c988ffc
commit 0a8d29d
Show file tree

Hide file tree

Showing 17 changed files with 129 additions and 129 deletions.
diff --git a/1_two_sum/two_sum.c → 001_two_sum/two_sum.c b/1_two_sum/two_sum.c → 001_two_sum/two_sum.c
diff --git a/2_add_two_numbers/Makefile → 002_add_two_numbers/Makefile b/2_add_two_numbers/Makefile → 002_add_two_numbers/Makefile
diff --git a/2_add_two_numbers/add_two_numbers.c → 002_add_two_numbers/add_two_numbers.c b/2_add_two_numbers/add_two_numbers.c → 002_add_two_numbers/add_two_numbers.c
diff --git a/3_longest_substring_without_repeat/Makefile → ...longest_substring_without_repeat/Makefile b/3_longest_substring_without_repeat/Makefile → ...longest_substring_without_repeat/Makefile
diff --git a/...repeat/longest_substring_without_repeat.c → ...repeat/longest_substring_without_repeat.c b/...repeat/longest_substring_without_repeat.c → ...repeat/longest_substring_without_repeat.c
diff --git a/4_median_of_two_sorted_array/Makefile → 004_median_of_two_sorted_array/Makefile b/4_median_of_two_sorted_array/Makefile → 004_median_of_two_sorted_array/Makefile
diff --git a/...sorted_array/median_of_two_sorted_array.c → ...sorted_array/median_of_two_sorted_array.c b/...sorted_array/median_of_two_sorted_array.c → ...sorted_array/median_of_two_sorted_array.c
diff --git a/5_longest_palindromic_substring/Makefile → 005_longest_palindromic_substring/Makefile b/5_longest_palindromic_substring/Makefile → 005_longest_palindromic_substring/Makefile
diff --git a/...substring/longest_palindromic_substring.c → ...substring/longest_palindromic_substring.c b/...substring/longest_palindromic_substring.c → ...substring/longest_palindromic_substring.c
diff --git a/8_atoi/atoi.c → 008_atoi/atoi.c b/8_atoi/atoi.c → 008_atoi/atoi.c
diff --git a/13_roman_numeral/Makefile → 013_roman_numeral/Makefile b/13_roman_numeral/Makefile → 013_roman_numeral/Makefile
diff --git a/13_roman_numeral/roman_numeral.c → 013_roman_numeral/roman_numeral.c b/13_roman_numeral/roman_numeral.c → 013_roman_numeral/roman_numeral.c
diff --git a/...r_combinations_of_a_phone_number/Makefile → ...r_combinations_of_a_phone_number/Makefile b/...r_combinations_of_a_phone_number/Makefile → ...r_combinations_of_a_phone_number/Makefile
diff --git a/...s_of_a_phone_number/letter_combinations.c → ...s_of_a_phone_number/letter_combinations.c b/...s_of_a_phone_number/letter_combinations.c → ...s_of_a_phone_number/letter_combinations.c
diff --git a/51_n_queens/Makefile → 051_n_queens/Makefile b/51_n_queens/Makefile → 051_n_queens/Makefile
diff --git a/051_n_queens/n_queens.c b/051_n_queens/n_queens.c
@@ -0,0 +1,129 @@
+/*
+ * Copyright (C) 2015, Leo Ma <[email protected]>
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <assert.h>
+
+static int N;
+
+static inline int conflict(int *stack, int i, int j)
+{
+    int k;
+    for (k = 0; k < i; k++) {
+        if (j == stack[k] || abs(i - k) == abs(j - stack[k])) {
+            return 1;
+        }
+    }
+
+    return 0;
+}
+
+static inline void push(int *stack, int i, int j)
+{
+    stack[i] = j;
+    // printf("push %d %d\n", i, j);
+}
+
+static inline int pop(int *stack, int i)
+{
+    int j = stack[i];
+    stack[i] = -1;
+    // printf("pop %d %d\n", i, j);
+    return j;
+}
+
+static inline int top(int *stack)
+{
+    int i;
+    for (i = N - 1; i >= 0; i--) {
+        if (stack[i] != -1) {
+            return i;
+        }
+    }
+
+    return 0;
+}
+
+void show(int *stack)
+{
+    int i, j;
+    for (i = 0; i < N; i++) {
+        for (j = 0; j < N; j++) {
+            if (j == stack[i]) {
+                printf("Q");
+            } else {
+                printf(".");
+            }
+        }
+        printf("\n");
+    }
+}
+
+int main(int argc, char **argv)
+{
+    int i, j, sum = 0;
+    int *stack;
+
+    if (argc != 2) {
+        printf("Usage: ./queen 8\n");
+        exit(-1);
+    }
+
+    N = atoi(argv[1]);
+    if (N <= 0) {
+        exit(0);
+    }
+
+    stack = malloc(N * sizeof(*stack));
+    if (stack == NULL) {
+        exit(-1);
+    }
+
+    if (N == 1) {
+        stack[0] = 0;
+        show(stack);
+        printf("This is the %dth solution.\n", ++sum);
+        exit(0);
+    }
+
+    for (i = 0; i < N; i++) {
+        stack[i] = -1;
+    }
+
+    i = j = 0;
+    for (; ;) {
+        for (; i < N; i++) {
+            while (j < N) {
+                if (conflict(stack, i, j)) {
+                    while (j == N - 1) {
+                        /* No space for row[i] so backtracking is needed */
+                        if (--i < 0) {
+                            free(stack);
+                            exit(0);
+                        }
+                        j = pop(stack, i);
+                    }
+                    j++;
+                } else {
+                    push(stack, i, j);
+                    break;
+                }
+            }
+            j = 0;
+        }
+
+        i = top(stack);
+        if (i == N - 1) {
+            show(stack);
+            printf("This is the %dth solution.\n", ++sum);
+        }
+
+        j = pop(stack, i);
+        j++;
+    }
+
+    assert(0);
+    return 0;
+}
diff --git a/51_n_queens/n_queens.c b/51_n_queens/n_queens.c