|
摘要：
// 100_12.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include struct Node { Node * left; Node * right; int value; }; void visit(Node * root) { if(!root) ... 阅读全文
posted @ 2010-09-24 14:47 KurtWang 阅读(266) 评论(0) 推荐(0)
摘要：
// 100_11.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include struct Node { Node * left; Node * right; int value; }; void mirror(Node * root) { if(root==... 阅读全文
posted @ 2010-09-24 14:41 KurtWang 阅读(156) 评论(0) 推荐(0)
摘要：
// 100_6.cpp : Defines the entry point for the console application. // #include "stdafx.h" bool verify(int * arr, int len) { if(arr == NULL || len root) break; } int j=i; for(;j0) left = v... 阅读全文
posted @ 2010-09-24 13:21 KurtWang 阅读(205) 评论(0) 推荐(0)
摘要：
#include "stdafx.h" #include struct Node { Node * left; Node * right; int value; }; void findPath(Node * root, std::vector path, int sum, int cur_sum) { if(root==NULL) return; cur_sum += roo... 阅读全文
posted @ 2010-09-24 11:35 KurtWang 阅读(263) 评论(0) 推荐(0)
摘要：
#include "stdafx.h" struct node { node * left; node * right; int value; }; void convert(node * root, node *& last) { if(root == NULL) return; if(root->left) convert(root->left, last); ro... 阅读全文
posted @ 2010-09-24 11:18 KurtWang 阅读(512) 评论(2) 推荐(0)
摘要：
// 2_16.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #define INT_MIN -1000000; int binary_search(int *a,int len,int n)//若返回值为x,则a[x]>=n>a[x-1] { int left=0,right=len-1,mid=(left+right)/2; while(... 阅读全文
posted @ 2010-09-23 23:30 KurtWang 阅读(587) 评论(0) 推荐(0)
摘要：
#include "stdafx.h" void reverse(int * arr, int left, int right) { for(;left<right;left++,right--) { int temp = arr[left]; arr[left] = arr[right]; arr[right] = temp; } } void shift(int * arr... 阅读全文
posted @ 2010-09-23 21:51 KurtWang 阅读(305) 评论(0) 推荐(0)
摘要：
#include "stdafx.h" //返回下标 int maxSum(int * arr, int len, int & left, int & right) { int start = arr[0]; int sum = arr[0]; left=0; right=0; int cur_left=0,cur_right=0; for(int i=1;i sum) { ... 阅读全文
posted @ 2010-09-23 21:22 KurtWang 阅读(1021) 评论(4) 推荐(0)
摘要：
#include "stdafx.h" //书解法一 int max(int * arr, size_t len) { int * s = new int[len+1]; int * t = new int[len+1]; int * p = new int[len]; s[0] = 1; t[len] = 1; for(int i=1;i max) max = p[i]; ... 阅读全文
posted @ 2010-09-23 20:53 KurtWang 阅读(334) 评论(0) 推荐(0)
摘要：
#include "stdafx.h" #include void check_sum(int * arr, size_t len, int sum) { assert(arr); int i=0,j=len-1; while(i sum) j--; else i++; } } int _tmain(int argc, _TCHAR* argv[]) { int... 阅读全文
posted @ 2010-09-23 20:25 KurtWang 阅读(330) 评论(0) 推荐(0) |
||
浙公网安备 33010602011771号