https://blog.youkuaiyun.com/chencong125zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/chencong125/article/details/48193843https://blog.youkuaiyun.com/chencong125/article/details/48193843chencong125Thu, 03 Sep 2015 10:54:17 +0800https://blog.youkuaiyun.com/chencong125/article/details/47778873https://blog.youkuaiyun.com/chencong125/article/details/47778873chencong125Wed, 19 Aug 2015 12:41:03 +0800https://blog.youkuaiyun.com/chencong125/article/details/47757711https://blog.youkuaiyun.com/chencong125/article/details/47757711chencong125Tue, 18 Aug 2015 19:55:08 +0800https://blog.youkuaiyun.com/chencong125/article/details/47377175https://blog.youkuaiyun.com/chencong125/article/details/47377175chencong125Sun, 09 Aug 2015 16:27:19 +0800https://blog.youkuaiyun.com/chencong125/article/details/47342413https://blog.youkuaiyun.com/chencong125/article/details/47342413chencong125Fri, 07 Aug 2015 17:20:22 +0800https://blog.youkuaiyun.com/chencong125/article/details/47336739https://blog.youkuaiyun.com/chencong125/article/details/47336739chencong125Fri, 07 Aug 2015 11:34:30 +0800 #include #include using namespace std; struct Node{ int x; Node( int a= 0):x(a) {} friend bool operator<(Node a,Node b ) { ret]]>https://blog.youkuaiyun.com/chencong125/article/details/47319753https://blog.youkuaiyun.com/chencong125/article/details/47319753chencong125Thu, 06 Aug 2015 17:02:15 +0800 #include #includehttps://blog.youkuaiyun.com/chencong125/article/details/47285191https://blog.youkuaiyun.com/chencong125/article/details/47285191chencong125Tue, 04 Aug 2015 23:28:25 +0800 #include #include #include using namespace std;bool myfunction (const string str1,const string str2) { return (str2.length() < str1.length()); }void my]]>https://blog.youkuaiyun.com/chencong125/article/details/47285141https://blog.youkuaiyun.com/chencong125/article/details/47285141chencong125Tue, 04 Aug 2015 23:26:02 +0800 #include using namespace std; int delete_sub_str(char *input,char *sub_str,char *result) { int count=0; int len = strlen(sub_str); char *p = result; while(*in]]>https://blog.youkuaiyun.com/chencong125/article/details/47285117https://blog.youkuaiyun.com/chencong125/article/details/47285117chencong125Tue, 04 Aug 2015 23:24:26 +0800https://blog.youkuaiyun.com/chencong125/article/details/47093077https://blog.youkuaiyun.com/chencong125/article/details/47093077chencong125Mon, 27 Jul 2015 22:44:13 +0800https://blog.youkuaiyun.com/chencong125/article/details/47056543https://blog.youkuaiyun.com/chencong125/article/details/47056543chencong125Sat, 25 Jul 2015 15:03:23 +0800 #include #include #include #include #includehttps://blog.youkuaiyun.com/chencong125/article/details/47047701https://blog.youkuaiyun.com/chencong125/article/details/47047701chencong125Fri, 24 Jul 2015 21:56:12 +0800 #include using namespace std; class Solution1 { public: vector findindex(vectora,int target) { vectorres; int first=0,last=a.size()-1;]]>https://blog.youkuaiyun.com/chencong125/article/details/47044345https://blog.youkuaiyun.com/chencong125/article/details/47044345chencong125Fri, 24 Jul 2015 17:24:23 +0800 #include using namespace std; class Solution { public: int findindex(vectora,int target) { if(a.empty()) return 0; int first=0,last=a]]>https://blog.youkuaiyun.com/chencong125/article/details/47044001https://blog.youkuaiyun.com/chencong125/article/details/47044001chencong125Fri, 24 Jul 2015 17:07:14 +0800 #include using namespace std; class Solution { public: bool find(vector>a,int target) { int l=0; int r=a.size()*a.back().size()-1;]]>https://blog.youkuaiyun.com/chencong125/article/details/46971089https://blog.youkuaiyun.com/chencong125/article/details/46971089chencong125Mon, 20 Jul 2015 17:13:51 +0800 using namespace std;void findfirstpositive(int a[],int length) { for(int i=0;i0&&a[i]<=length&&i!=a[i]-1) { swap(a[i],a[a[i]]>https://blog.youkuaiyun.com/chencong125/article/details/46969259https://blog.youkuaiyun.com/chencong125/article/details/46969259chencong125Mon, 20 Jul 2015 15:47:37 +0800 using namespace std;struct ListNode { int value; ListNode* next; ListNode(int value):value(value),next(NULL){}; }; ListNode* Insertsort(ListNode* head) { if(!head)]]>https://blog.youkuaiyun.com/chencong125/article/details/46941405https://blog.youkuaiyun.com/chencong125/article/details/46941405chencong125Sat, 18 Jul 2015 11:48:01 +0800 using namespace std; void Insertsort(int a[],int length) { /*int i,j,temp; for(i=0;ihttps://blog.youkuaiyun.com/chencong125/article/details/46929295https://blog.youkuaiyun.com/chencong125/article/details/46929295chencong125Fri, 17 Jul 2015 16:32:49 +0800 #include using namespace std; struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(int val):val(val),left(NULL),right(NULL){}; }; struct ListN]]>https://blog.youkuaiyun.com/chencong125/article/details/46927405https://blog.youkuaiyun.com/chencong125/article/details/46927405chencong125Fri, 17 Jul 2015 14:51:07 +0800 #include using namespace std; struct TreeNode { int val; TreeNode* left; TreeNode* right; TreeNode(int val):val(val),left(NULL),right(NULL){}; }; class Soluti]]>