https://blog.youkuaiyun.com/yangrujingzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/yangrujing/article/details/52490807https://blog.youkuaiyun.com/yangrujing/article/details/52490807yangrujingFri, 09 Sep 2016 21:55:50 +0800https://blog.youkuaiyun.com/yangrujing/article/details/52434458https://blog.youkuaiyun.com/yangrujing/article/details/52434458yangrujingSun, 04 Sep 2016 20:18:58 +0800https://blog.youkuaiyun.com/yangrujing/article/details/52016222https://blog.youkuaiyun.com/yangrujing/article/details/52016222yangrujingSun, 24 Jul 2016 21:03:14 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51985914https://blog.youkuaiyun.com/yangrujing/article/details/51985914yangrujingThu, 21 Jul 2016 19:24:04 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51985860https://blog.youkuaiyun.com/yangrujing/article/details/51985860yangrujingThu, 21 Jul 2016 19:17:39 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51868630https://blog.youkuaiyun.com/yangrujing/article/details/51868630yangrujingSat, 09 Jul 2016 21:17:10 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51863734https://blog.youkuaiyun.com/yangrujing/article/details/51863734yangrujingFri, 08 Jul 2016 20:34:42 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51570489https://blog.youkuaiyun.com/yangrujing/article/details/51570489yangrujingThu, 02 Jun 2016 21:54:08 +0800 using namespace std;struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNo]]>https://blog.youkuaiyun.com/yangrujing/article/details/51519109https://blog.youkuaiyun.com/yangrujing/article/details/51519109yangrujingFri, 27 May 2016 19:14:26 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51418651https://blog.youkuaiyun.com/yangrujing/article/details/51418651yangrujingSun, 15 May 2016 20:05:03 +0800 using namespace std;bool IsOdd(int n) //判断是否为奇数 { return (n & 1) == 1; }void ReOrder1(int *arr, int len, bool (*fun)(int)) { int begin = 0; int end = len]]>https://blog.youkuaiyun.com/yangrujing/article/details/51418409https://blog.youkuaiyun.com/yangrujing/article/details/51418409yangrujingSun, 15 May 2016 19:24:12 +0800 #include using namespace std;bool add(char *num) { if (num == NULL) return false; bool OverFlow = false; int nTakeOver = 0;//表示进位 int len = strlen(n]]>https://blog.youkuaiyun.com/yangrujing/article/details/51407409https://blog.youkuaiyun.com/yangrujing/article/details/51407409yangrujingSat, 14 May 2016 18:39:08 +0800 using namespace std;//判断浮点数是否等于0 bool equal(double d1, dou]]>https://blog.youkuaiyun.com/yangrujing/article/details/51377823https://blog.youkuaiyun.com/yangrujing/article/details/51377823yangrujingWed, 11 May 2016 20:07:56 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51375451https://blog.youkuaiyun.com/yangrujing/article/details/51375451yangrujingWed, 11 May 2016 16:15:09 +0800 using namespace std;int* MergeTwoArr(int *arr1, int *arr2, int len1, int len2) { if]]>https://blog.youkuaiyun.com/yangrujing/article/details/51347790https://blog.youkuaiyun.com/yangrujing/article/details/51347790yangrujingSun, 08 May 2016 21:20:02 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51340588https://blog.youkuaiyun.com/yangrujing/article/details/51340588yangrujingSat, 07 May 2016 22:50:11 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51338963https://blog.youkuaiyun.com/yangrujing/article/details/51338963yangrujingSat, 07 May 2016 17:28:29 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51334723https://blog.youkuaiyun.com/yangrujing/article/details/51334723yangrujingFri, 06 May 2016 21:19:52 +0800https://blog.youkuaiyun.com/yangrujing/article/details/51318591https://blog.youkuaiyun.com/yangrujing/article/details/51318591yangrujingFri, 06 May 2016 17:03:57 +0800https://blog.youkuaiyun.com/yangrujing/article/details/50505506https://blog.youkuaiyun.com/yangrujing/article/details/50505506yangrujingTue, 12 Jan 2016 17:12:30 +0800 using namespace std;void SelectSort(int *arr, int size) { int begin = 0, end = size - 1; while (begin < end) { int min = begin; int max = end; for]]>