动态规划求数组中和最大字串的值 以及 字符串的循环移位(要求空间复杂度O(1)，时间复杂度O(n))

[问题描述]

 (1)

 (2)最大公约数，时间复杂度尽量小      (3)字符串的循环移位(要求空间复杂度O(1)，时间复杂度O(n))

 (4 )二叉树的磁盘存储，要求磁盘文件空间尽可能的省  (5)动态规划求数组中和最大字串的值

[解答如下]

/* * main.cpp * * Created on: 2009-6-30 * Author: NeeSky */ #include <iostream> #include <fstream> #include <sstream> using namespace std; /** * [2]求最大公约数 * */ int GCD(int m, int n) { if (n < m) std::swap(n, m); //m is big, n is small while (n != 0) { int rem = m % n; m = n; n = rem; } return m; } /*** * [3] 数组的循环右移 要求空间复杂度为O（1），,时间复杂度O（N）, 不调用字符串库函数 * @param strOrignal * @param n 右移n位 */ void RightLoopMove(string& strOriginal, int n) { int len = 0; while (strOriginal[len] != '/0') len++; //Get the length int i = 0; char temp; //空间复杂度O(1) for (int k = 0; k < n; ++k) { i = k; while (true) { temp = strOriginal[k]; strOriginal[k] = strOriginal[(i + n) % len]; strOriginal[(i + n) % len] = temp; if ((i + n) % len == k) break; i = (i + n) % len; } if (len % 2 == 1) //长度为奇数时，while循环一次可以搞定 break; } return; } /*** * [3]二叉树，不一定是满二叉树的文件存储，要求空间经可能少 * 并能读入读出二叉数 */ typedef struct TNode { char value; TNode * left; TNode * right; } Node, *Tree; /** * 递归求二叉树的深度 * */ int Depth(Tree &t) { if (t == NULL) return 0; int lD = Depth(t->left); int rD = Depth(t->right); return lD < rD ? ++rD : ++lD; } /** * 读取满二叉存储的数组创建实际的二叉数(该数组的值来自磁盘文件) * */ Node* CreatBinaryTree(char a[], int n, int i = 0) //满二叉树 { if (i >= n || a[i] == '/b') return NULL; Tree root = new Node; root->value = a[i]; root->left = CreatBinaryTree(a, n, 2 * (i + 1) - 1); root->right = CreatBinaryTree(a, n, 2 * (i + 1)); return root; } /** * 先序遍历二叉树，并把其数据存放在满二叉树形式的数组中，长度为n的数组, * n应为2*dep+1,dep为二叉树的深度 */ void PreOrderBuildArray_fromBinaryTree(Tree t, char a[], int n, int i = 0) { if (t != NULL && i < n) { a[i] = t->value; PreOrderBuildArray_fromBinaryTree(t->left, a, n, 2 * (i + 1) - 1); PreOrderBuildArray_fromBinaryTree(t->right, a, n, 2 * (i + 1)); } else if (i < n) { int k = 2 * (i + 1) - 1; while (k < n) { a[i] = '/b'; a[k] = '/b'; if (k + 1 < n) a[k + 1] = '/b'; k = 2 * (k + 1); } } return; } void PreOrderOutput_fromBinaryTree(Tree t) { if (t != NULL) { cout << t->value << " "; PreOrderOutput_fromBinaryTree(t->left); PreOrderOutput_fromBinaryTree(t->right); } return; } /** * 将二叉树读入满二叉数数组后，将该数组输出到文件，文件行以"#"字符结束 */ void ReadBinaryTree_toWriteFile(Tree &t, const char *filename) { int len = 2 * Depth(t) + 1; //求出二叉树的深度 char a[len]; PreOrderBuildArray_fromBinaryTree(t, a, len); //存储满二叉树的数组空间 ofstream ofs(filename); for (int i = 0; i < len; ++i) ofs << a[i] << " "; //输出数组到文件 ofs << "#" << flush;//文件结束符标记 return; } /** * 把格式文件中的n个字符存放到长度为n的数组中 */ void readFileLine_toArray(char a[], int n, const char *filename) { ifstream ifs(filename); string line; char tChar; if (getline(ifs, line)) { int i = 0; istringstream iss(line); while (iss >> tChar) { if (tChar == '#' || i >= n) break; else a[i++] = tChar; } } return; } /** * 根据从文件中读取的字符串的长得得出数组满二叉树的结点数 */ int arrayLength(string& str) { return (str.length() - 1) / 2; } /** * 从文件中读入一行并创建文二叉树，文件中的一行是按照满二叉树存储的 */ Node* CreatBinaryTree_fromReadFile(const char* filename) { ifstream ifs(filename); string line; int len; if (getline(ifs, line)) len = arrayLength(line); //得出应该创建数组的长度 char a[len]; readFileLine_toArray(a, len, filename); return CreatBinaryTree(a, len); //满二叉树 } /*** *[4] 求数组中的子串的最大和的值- (最简单的)动态规划 * @return */ int GetMaxValue_inSubString(int a[], int n) { int assistantA[n]; int max = a[0]; assistantA[0] = a[0]; for (int i = 1; i < n; ++i) { if (assistantA[i - 1] < 0) assistantA[i] = a[i]; //key step else assistantA[i] = assistantA[i - 1] + a[i]; if (assistantA[i] > max) max = assistantA[i]; } return max; } /*** * THE MAIN PROGRAMMING * @return */ int main() { cout << "[2] The GCD Problem:" << endl; cout << "GCD[9,12] = " << GCD(9, 12) << endl << endl; cout << "[3]Right Loop Problem:" << endl; string str = "1234567"; RightLoopMove(str, 2); cout << "1234567 Right Loop 2 seats:" << str << endl; str = "123456"; RightLoopMove(str, 2); cout << "123456 Right Loop 2 seats:" << str << endl << endl; cout << "[4] The BinaryTree Write and Read with file -Problem:" << endl; char b[7] = { '1', '2', '/b', '4', '5', '/b', '/b' }; //先序的满二叉树 Tree BiTree = CreatBinaryTree(b, 7); ReadBinaryTree_toWriteFile(BiTree, "WriteTo.txt");//按照先序遍历创建的二叉数的满二叉数组写入到文件中 cout << "Write a file from a binary tree: [PreOrder]"; PreOrderOutput_fromBinaryTree(BiTree); cout << endl; ofstream ofs("ReadFrom.txt"); ofs << "1 2 /b 4 5 /b /b #" << flush;//准备文件 Tree Bi2Tree = CreatBinaryTree_fromReadFile("ReadFrom.txt");//从指定的文件中读入数据，创建二叉数，先序遍历 cout << "Read from file ,create binayr tree: [PreOrder]"; PreOrderOutput_fromBinaryTree(Bi2Tree); cout << endl << endl; cout << "[5] Max SubString Value Problem:" << endl; int a[6] = { -1, -2, 2, 1, -7, 0 }; cout << "Problem SubString : (result) " << GetMaxValue_inSubString(a, 6)<< endl; return 1; } 

[输出结果]

[2] The GCD Problem:
GCD[9,12] = 3

[3]Right Loop Problem:
1234567 Right Loop 2 seats:6712345
123456 Right Loop 2 seats:561234

[4] The BinaryTree Write and Read with file -Problem:
Write a file from a binary tree: [PreOrder]1 2 4 5
Read from file ,create binayr tree: [PreOrder]1 2 4 5

[5] Max SubString Value Problem:
Problem SubString :  (result) 3