38{
-
+
39 int i, j, max, sum;
40 unsigned char *beads;
41
-
42 for (i = 1,
max = a[0]; i < len; i++)
-
-
+
42 for (i = 1, max = a[0]; i < len; i++)
+
43 if (a[i] > max)
+
44 max = a[i];
45
-
+
46 beads =
calloc(1, max * len);
47
48
49 for (i = 0; i < len; i++)
50 for (j = 0; j < a[i]; j++)
BEAD(i, j) = 1;
51
-
52 for (j = 0; j <
max; j++)
+
52 for (j = 0; j < max; j++)
53 {
54
55 for (sum = i = 0; i < len; i++)
@@ -202,13 +202,12 @@ Functions
63
64 for (i = 0; i < len; i++)
65 {
-
66 for (j = 0; j <
max &&
BEAD(i, j); j++)
+
66 for (j = 0; j < max &&
BEAD(i, j); j++)
67 ;
68 a[i] = j;
69 }
71}
-
#define max(a, b)
shorthand for maximum value
Definition: kohonen_som_topology.c:39
#define BEAD(i, j)
Create easy access of elements from a 2D matrix stored in memory as a 1D array.
Definition: bead_sort.c:16
#define free(ptr)
This macro replace the standard free function with free_dbg.
Definition: malloc_dbg.h:26
#define calloc(elemCount, elemSize)
This macro replace the standard calloc function with calloc_dbg.
Definition: malloc_dbg.h:22
diff --git a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
index 740c7ebf..124e1c19 100644
--- a/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
+++ b/d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
@@ -150,150 +150,152 @@ LeetCode Algorithm
| 38 | Count and Say | C | Easy |
+| 42 | Trapping Rain Water | C | Hard |
+
| 53 | Maximum Subarray | C | Easy |
-
+
| 62 | Unique Paths | C | Medium |
-
+
| 66 | Plus One | C | Easy |
-
+
| 82 | Remove Duplicates from Sorted List II | C | Medium |
-
+
| 83 | Remove Duplicates from Sorted List | C | Easy |
-
+
| 94 | Binary Tree Inorder Traversal | C | Medium |
-
+
| 101 | Symmetric Tree | C | Easy |
-
+
| 104 | Maximum Depth of Binary Tree | C | Easy |
-
+
| 108 | Convert Sorted Array to Binary Search Tree | C | Easy |
-
+
| 109 | Convert Sorted List to Binary Search Tree | C | Medium |
-
+
| 110 | Balanced Binary Tree | C | Easy |
-
+
| 112 | Path Sum | C | Easy |
-
+
| 118 | Pascal's Triangle | C | Easy |
-
+
| 121 | Best Time to Buy and Sell Stock | C | Easy |
-
+
| 125 | Valid Palindrome | C | Easy |
-
+
| 136 | Single Number | C | Easy |
-
+
| 141 | Linked List Cycle | C | Easy |
-
+
| 142 | Linked List Cycle II | C | Medium |
-
+
| 153 | Find Minimum in Rotated Sorted Array | C | Medium |
-
+
| 160 | Intersection of Two Linked Lists | C | Easy |
-
+
| 169 | Majority Element | C | Easy |
-
+
| 173 | Binary Search Tree Iterator | C | Medium |
-
+
| 189 | Rotate Array | C | Easy |
-
+
| 190 | Reverse Bits | C | Easy |
-
+
| 191 | Number of 1 Bits | C | Easy |
-
+
| 201 | Bitwise AND of Numbers Range | C | Medium |
-
+
| 203 | Remove Linked List Elements | C | Easy |
-
+
| 206 | Reverse Linked List | C | Easy |
-
+
| 215 | Kth Largest Element in an Array | C | Medium |
-
+
| 217 | Contains Duplicate | C | Easy |
-
+
| 223 | Rectangle Area | C | Medium |
-
+
| 226 | Invert Binary Tree | C | Easy |
-
+
| 231 | Power of Two | C | Easy |
-
+
| 234 | Palindrome Linked List | C | Easy |
-
+
| 242 | Valid Anagram | C | Easy |
-
+
| 268 | Missing Number | C | Easy |
-
+
| 278 | First Bad Version | C | Easy |
-
+
| 283 | Move Zeroes | C | Easy |
-
+
| 287 | Find the Duplicate Number | C | Medium |
-
+
| 344 | Reverse String | C | Easy |
-
+
| 367 | Valid Perfect Square | C | Easy |
-
+
| 387 | First Unique Character in a String | C | Easy |
-
+
| 389 | Find the Difference | C | Easy |
-
+
| 404 | Sum of Left Leaves | C | Easy |
-
+
| 442 | Find All Duplicates in an Array | C | Medium |
-
+
| 461 | Hamming Distance | C | Easy |
-
+
| 476 | Number Complement | C | Easy |
-
+
| 509 | Fibonacci Number | C | Easy |
-
+
| 520 | Detect Capital | C | Easy |
-
+
| 561 | Array Partition I | C | Easy |
-
+
| 617 | Merge Two Binary Trees | C | Easy |
-
+
| 647 | Palindromic Substring | C | Medium |
-
+
| 674 | Longest Continuous Increasing Subsequence | C | Easy |
-
+
| 700 | Search in a Binary Search Tree | C | Easy |
-
+
| 701 | Insert into a Binary Search Tree | C | Medium |
-
+
| 704 | Binary Search | C | Easy |
-
+
| 709 | To Lower Case | C | Easy |
-
+
| 771 | Jewels and Stones | C | Easy |
-
+
| 852 | Peak Index in a Mountain Array | C | Easy |
-
+
| 876 | Middle of the Linked List | C | Easy |
-
+
| 905 | Sort Array By Parity | C | Easy |
-
+
| 917 | Reverse Only Letters | C | Easy |
-
+
| 938 | Range Sum of BST | C | Easy |
-
+
| 965 | Univalued Binary Tree | C | Easy |
-
+
| 977 | Squares of a Sorted Array | C | Easy |
-
+
| 1009 | Complement of Base 10 Integer | C | Easy |
-
+
| 1089 | Duplicate Zeros | C | Easy |
-
+
| 1184 | Distance Between Bus Stops | C | Easy |
-
+
| 1189 | Maximum Number of Balloons | C | Easy |
-
+
| 1207 | Unique Number of Occurrences | C | Easy |
-
-| 1524 | Number of Sub-arrays With Odd Sum | C | Medium |
-| 1752 | Check if Array Is Sorted and Rotated | C | Easy |
+
1524 | Number of Sub-arrays With Odd Sum | C | Medium |
+| 1752 | Check if Array Is Sorted and Rotated | C | Easy |
+
| 2130 | Maximum Twin Sum of a Linked List | C | Medium |