通用字符串处理方法

#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}<textarea readonly="readonly" name="code" class="c++"> #ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}<textarea readonly="readonly" name="code" class="c++"> #ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}<textarea readonly="readonly" name="code" class="c++"> #ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}<textarea readonly="readonly" name="code" class="c++"> #ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}<textarea readonly="readonly" name="code" class="c++"> #ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}#ifndef __C_COMMON_H#define __C_COMMON_H#define SUCCESS 1#define FAILED 0#define ERROR -1#define NUM0 0#define NUM1 1#define NUM2 2#define NUM3 3#define NUM4 4#define NUM5 5#define NUM6 6#define NUM7 7#define NUM8 8#define NUM9 9#define NUM10 10#define NUM11 11#define NUM12 12#define NUM13 13#define NUM14 14#define NUM15 15#define NUM16 16#define NUM32 32 char CM_TOLOWER (char c);char CM_TOUPPER (char c);int CM_TONUMBER (char c);char CM_TOCHAR (int n);bool CM_ISEMPTY (char *s);bool CM_ISSPACE (char *s);bool CM_ISALPHA (char *s);char *CM_LTRIM (char *s);char *CM_RTRIM (char *s);char *CM_TRIM (char *s);// 查找子字符串int CM_FINDSUB (char *sub, char *src);// 快速排序void CM_QUICK_SORT (int s[], int l, int r);// 归并排序static void MergeArray (int a[], int first, int mid, int last, int temp[]);static void MergeSort (int a[], int first, int last, int temp[]);bool CM_MERGE_SORT (int a[], int n);// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n);// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n);void CM_SWAP (int a, int b);static void MinHeapFixDown (int a[], int i, int n);// 字符串分割void CM_STR_SPLIT (char *str, char *delimiters, char **args);//glib库函数实现char *CM_STRCPY (char strDes, const char *strSrc);char *CM_STRNCPY (char strDes, const char *strSrc, unsigned int count);char CM_STRCMP (const char *s, const char *t);char CM_STRCMP (const char *s, const char *t, unsigned int count);char *CM_STRCAT (char *strDes, const char *strSrc);char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count);int CM_STRLEN (const char *str);char *CM_STRSTR (const char *strSrc, const char *str);void *CM_MEMCPY (void *dest, const void *src, unsigned int count);void *CM_MEMSET (void *str, int c, unsigned int count);// 反转整数int CM_REVERSE_INTEGER (int n);// 字符串转换为整数long CM_STR2LONG (char *s);#endif // __C_COMMON_H#include <stdio h="">#include <stdlib h="">#include <string h="">#include <assert h="">#include "common.h"char CM_TOLOWER (char c){if (c >= 'A' && c <= 'Z')c += 'a' - 'A';return c;}char CM_TOUPPER (char c){if (c >= 'a' && c <= 'z')c -= 'a' - 'A';return c;}int CM_TONUMBER (char c){int n;switch (c) { case '0':n = 0;break;case '1':n = 1;break;case '2':n = 1;break;case '3':n = 3;break;case '4':n = 4;break;case '5':n = 5;break;case '6':n = 6;break;case '7':n = 7;break;case '8':n = 8;break;case '9':n = 9;break;case 'a':case 'A':n = 10;break;case 'b':case 'B':n = 11;break;case 'c':case 'C':n = 12;break;case 'd':case 'D':n = 13;break;case 'e':case 'E':n = 14;break;case 'f':case 'F':n = 15;break;default:n = -1;break;}return n;}char CM_TOCHAR (int n){assert (n >= 0 && n <= 15);char *s = "0123456789ABCDEF";return s[n];}bool CM_ISEMPTY (char *s){if (s == NULL || 0 == strlen (s))return true;return false;}bool CM_ISSPACE (char *s){assert (s != NULL);while (*s != '\0'){if (*s != ' ')return false;++s;}return true;}bool CM_ISDIGIT (char *s){assert (s != NULL);while (*s != '\0'){if (*s < '0' || *s > '9')return false;++s;}return true;}bool CM_ISALPHA (char *s){assert (s != NULL);char c;while (*s != '\0'){c = *s;if ( (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') )return false;++s;}return true;}char *CM_LTRIM (char *str){assert (str != NULL);while (*str == ' ')++str;return str;}char *CM_RTRIM (char *str){assert (str != NULL);char *s = str;int len = strlen (s);s += len - 1;while (*s == ' ')s--;*(++s) = '\0';return str;}char *CM_TRIM (char *str){char *s = str;s = CM_LTRIM (s);s = CM_RTRIM (s);return s;}// 查找子字符串int CM_FINDSUB (char *sub, char *src){int subLen, srcLen;int check = 0, count = 0;int i, j;if ((CM_ISEMPTY (sub) == true) || (CM_ISEMPTY (src) == true))return -1;subLen = strlen (sub);srcLen = strlen (src);if (subLen > srcLen)return count;for (i = 0; i <= srcLen - subLen; i++){check = 1;for (j = 0; j < subLen; j++){if (CM_TOUPPER(src[i + j]) != CM_TOUPPER (sub[j])){check = 0;break;}}if (check == 0)continue;if (check == 1){count++;i += subLen;}}return count;}// 快速排序void CM_QUICK_SORT (int s[], int l, int r){if (l < r){int i = l, j = r, x = s[i];while (l < r){while (i < j && s[j] >= x) // 从右向左找第一个小于x的数j--;if (i < j)s[i++] = s[j];while (i < j && s[i] < x) // 从左向右找第一个大于等于x的数i++;if (i < j)s[j--] = s[i];}s[i] = x;CM_QUICK_SORT (s, l, i - 1);CM_QUICK_SORT (s, i + 1, r);}}// 归并排序bool CM_MERGE_SORT (int a[], int n){ int temp[1024];MergeSort (a, 0, n - 1, temp);return true;}// 将有二个有序数列a[first...mid]和a[mid...last]合并void MergeArray (int a[], int first, int mid, int last, int temp[]){int i = first, j = mid + 1;int m = mid, n = last;int k = 0;while (i <= m && j <= n){if (a[i] < a[j])temp[k++] = a[i++];elsetemp[k++] = a[j++];}while (i <= m)temp[k++] = a[i++];while (j <= n)temp[k++] = a[j++];for (i = 0; i < k; i++)a[first + i] = temp[i];}void MergeSort (int a[], int first, int last, int temp[]){if (first < last){int mid = (first + last) / 2;MergeSort (a, first, mid, temp); // 左边有序MergeSort (a, mid + 1, last, temp); // 右边有序MergeArray (a, first, mid, last, temp); // 再将两个有序数列合并}}// 堆排序void CM_SWAP (int a, int b){int c = a;a = b;b = c;return;}// 建立最小堆// 从i节点开始调整, n为节点总数，从0开始计算 i节点的子节点是 2*i+1 2*i+2void MinHeapFixDown (int a[], int i, int n){ int j, temp;temp = a[i];j = 2 * i + 1;while (j < n){if (j + 1 < n && a[j + 1] < a[j]) // 在左右孩子中找最小的j++;if (a[j] >= temp)break;a[i] = a[j]; // 把较小的子节点往上移动，替换它的父节点i = j;j = 2 * i + 1;}a[i] = temp;}// 建立最小堆void CM_MAKE_MIN_HEAP (int a[], int n){int i;for (i = n / 2 - 1; i >= 0; i--) MinHeapFixDown (a, i, n);}// 堆排序void CM_MIN_HEAP_SORT_TODESCENDARRAY (int a[], int n){int i;for (i = n - 1; i >= 1; i--){CM_SWAP (a[i], a[0]);MinHeapFixDown (a, 0, i);}}void CM_STR_SPLIT (char *str, char *delimiters, char **args){int i, slen;int j, dlen;slen = strlen (str);dlen = strlen (delimiters);int start = -1;int count = 0;// 当前字符是否是特殊字符int flag = 0;for (i = 0; i <= slen; i++){ flag = 0; if (str[i] == '\0'){if (start != -1){args[count] = &str[start];count++;}str[i] = '\0';args[count] = NULL;break;}for (j = 0; j < dlen; j++){if (str[i] == delimiters[j]){if (start != -1){args[count] = &str[start]; count++;}str[i] = '\0';start = -1;flag = 1;break;}}if (flag == 1)continue;else{if (start == -1) start = i;}}return;}// glibc 库函数实现char *CM_STRCPY (char *strDes, const char *strSrc){if (strDes == strSrc) return strDes;assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCPY (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (count -- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}char CM_STRCMP (const char *s, const char *t){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t){++s;++t;}return (*s - *t);}char CM_STRCMP (const char *s, const char *t, unsigned int count){ assert ( (s != NULL) && (t != NULL) );while (*s && *t && *s == *t && --count){++s;++t;}return (*s - *t);}char *CM_STRCAT (char *strDes, const char *strSrc){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while ( (*strDes++ = *strSrc++) != '\0');return address;}char *CM_STRNCAT (char *strDes, const char *strSrc, unsigned int count){ assert ( (strDes != NULL) && (strSrc != NULL) );char *address = strDes;while (*strDes != '\0')++strDes;while (count-- && *strSrc != '\0')*strDes++ = *strSrc++;*strDes = '\0';return address;}int CM_STRLEN (const char *str){ assert (str != NULL);int len = 0;while (*str++ != '\0')++len;return len;}char *CM_STRSTR (const char *strSrc, const char *str){assert ( (strSrc != NULL) && (str != NULL) );const char *s = strSrc;const char *t = str;for (; *strSrc != '\0'; ++strSrc){for (s = strSrc, t = str; *t != '\0' && *t == *s; ++s, ++t)NULL;if (*t == '\0')return (char *) strSrc;}return NULL;}void *CM_MEMCPY (void *dest, const void *src, unsigned int count){ assert ( (dest != NULL) && (src != NULL) ); void *address = dest;while (count--){*(char *)dest = *(char *)src;dest = (char *)dest + 1;src = (char *)src + 1;}return address;}void *CM_MEMSET (void *str, int c, unsigned int count){assert (str != NULL);void *s = str;while (count--){*(char *)s = (char) c;s = (char *) s + 1;}return str;}// 反转整数int CM_REVERSE_INTEGER (int n){ bool neg = (n < 0);if (neg)n = -n;int res = 0;while (n){int t = n % 10;res = res * 10 + t;n = n / 10;}if (neg)res = -res;return res;}// 字符串转换为整数long CM_STR2LONG (char *s){assert (s != NULL);assert (strlen (s) < 9); long n = 0, t = 0;char *address = s;if (address[0] == '-')++s; assert (CM_ISDIGIT (s));while (*s != '\0'){t = CM_TONUMBER (*s);n = n * 10 + t;++s;} return (address[0] == '-') ? -n : n;}