removed non-ascii characters.

Author: vli02

131. Palindrome Partitioning.c

@@ -22,74 +22,74 @@ Return
  * Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
  */
 typedef struct {
-    int start;
-    int len;
+    int start;
+    int len;
 } buff_t;
 typedef struct {
-    char ***p;
-    int *csz;
-    int psz;
-    int pn;
+    char ***p;
+    int *csz;
+    int psz;
+    int pn;
 } res_t;
 void add2res(res_t *res, const char *s, buff_t *buff, int d) {
-    int i;
-    char *str, **pp;
-    if (res->psz == res->pn) {
-        res->psz = (res->psz == 0) ? 10 : res->psz * 2;
-        res->p = realloc(res->p, res->psz * sizeof(char **));
-        res->csz = realloc(res->csz, res->psz * sizeof(int));
-        //assert(res->p && res->psz);
-    }
-    pp = malloc(d * sizeof(char *));
-    //assert(pp);
-    for (i = 0; i < d; i ++) {
-        str = strndup(&s[buff[i].start], buff[i].len);
-        pp[i] = str;
-    }
-    res->p[res->pn] = pp;
-    res->csz[res->pn ++] = d;
+    int i;
+    char *str, **pp;
+    if (res->psz == res->pn) {
+        res->psz = (res->psz == 0) ? 10 : res->psz * 2;
+        res->p = realloc(res->p, res->psz * sizeof(char **));
+        res->csz = realloc(res->csz, res->psz * sizeof(int));
+        //assert(res->p && res->psz);
+    }
+    pp = malloc(d * sizeof(char *));
+    //assert(pp);
+    for (i = 0; i < d; i ++) {
+        str = strndup(&s[buff[i].start], buff[i].len);
+        pp[i] = str;
+    }
+    res->p[res->pn] = pp;
+    res->csz[res->pn ++] = d;
 }
 int is_palindrome(const char *s, int start, int end) {
-    while (start < end) {
-        if (s[start] != s[end]) return 0;
-        start ++;
-        end --;
-    }
-    return 1;
+    while (start < end) {
+        if (s[start] != s[end]) return 0;
+        start ++;
+        end --;
+    }
+    return 1;
 }
 void bt(const char *s, int start, int sz, buff_t *buff, int d, res_t *res) {
-    int i;
-    if (start == sz) {
-        // done, save result
-        add2res(res, s, buff, d);
-        return;
-    }
-    for (i = start; i < sz; i ++) {
-        if (is_palindrome(s, start, i)) {
-            buff[d].start = start;
-            buff[d].len = i - start + 1;
-            bt(s, i + 1, sz, buff, d + 1, res);
-        }
-    }
+    int i;
+    if (start == sz) {
+        // done, save result
+        add2res(res, s, buff, d);
+        return;
+    }
+    for (i = start; i < sz; i ++) {
+        if (is_palindrome(s, start, i)) {
+            buff[d].start = start;
+            buff[d].len = i - start + 1;
+            bt(s, i + 1, sz, buff, d + 1, res);
+        }
+    }
 }
 char*** partition(char* s, int** columnSizes, int* returnSize) {
-    res_t res = { 0 };
-    buff_t *buff;
-    int sz;
-    
-    sz = strlen(s);
-    
-    buff = malloc(sz * sizeof(buff_t));
-    //assert(buff);
-    
-    bt(s, 0, sz, buff, 0, &res);
-    
-    //free(buff);
-    
-    *columnSizes = res.csz;
-    *returnSize = res.pn;
-    
-    return res.p;
+    res_t res = { 0 };
+    buff_t *buff;
+    int sz;
+    
+    sz = strlen(s);
+    
+    buff = malloc(sz * sizeof(buff_t));
+    //assert(buff);
+    
+    bt(s, 0, sz, buff, 0, &res);
+    
+    //free(buff);
+    
+    *columnSizes = res.csz;
+    *returnSize = res.pn;
+    
+    return res.p;
 }
 
 

214. Shortest Palindrome.c

@@ -12,14 +12,14 @@ Credits:Special thanks to @ifanchu for adding this problem and creating all test
 */
 
 char* shortestPalindrome(char* s) {
-    // two pointers, head and tail
-    // verify if it is a valid palindrome
-    // if not, reduce tail pointer and repeat verify
-    // if yes, stop verify
-    // add characters from end to the tail pointer to a buffer
-    // append characters from head to tail to the buffer
-    // done
-    return s;
+    // two pointers, head and tail
+    // verify if it is a valid palindrome
+    // if not, reduce tail pointer and repeat verify
+    // if yes, stop verify
+    // add characters from end to the tail pointer to a buffer
+    // append characters from head to tail to the buffer
+    // done
+    return s;
 }
 
 

5. Longest Palindromic Substring.c

@@ -19,32 +19,32 @@ Output: "bb"
 */
 
 char* longestPalindrome(char* s) {
-    int sz;
-    int i, j, k, l;
-    int where = 0, len = 0;
-    
-    if (!s || !*s) return s;
-    
-    sz = strlen(s);
-​
-    for (i = 0, j = 0, k = 0; len < (sz - k) * 2; i = k, j = k) {
-        while (j + 1 < sz && s[j] == s[j + 1]) {
-            j ++;  // skip all repeating characters
-        }
-        k = j + 1; // where to start next try
-        while (i > 0 && j + 1 < sz && s[i - 1] == s[j + 1]) {
-            i --;  // expand dual direction
-            j ++;
-        }
-        l = j - i + 1; // what we have fond so far
-        if (len < l) {
-            len = l;
-            where = i;
-        }
-    }
-    s = s + where;
-    s[len] = 0;
-    return s;
+    int sz;
+    int i, j, k, l;
+    int where = 0, len = 0;
+    
+    if (!s || !*s) return s;
+    
+    sz = strlen(s);
+
+    for (i = 0, j = 0, k = 0; len < (sz - k) * 2; i = k, j = k) {
+        while (j + 1 < sz && s[j] == s[j + 1]) {
+            j ++;  // skip all repeating characters
+        }
+        k = j + 1; // where to start next try
+        while (i > 0 && j + 1 < sz && s[i - 1] == s[j + 1]) {
+            i --;  // expand dual direction
+            j ++;
+        }
+        l = j - i + 1; // what we have fond so far
+        if (len < l) {
+            len = l;
+            where = i;
+        }
+    }
+    s = s + where;
+    s[len] = 0;
+    return s;
 }