03 2022 档案
摘要：//Utility.h #ifndef Utility_H #define Utility_H #include <ctime> #include <iostream> #include <thread> #include <unistd.h> #include <uuid/uuid.h> usin
阅读全文
摘要：void Util::arrayAsc61(int len) { stringstream ss; int *arr = new int[len]; getArray23(arr, len); chrono::time_point<chrono::system_clock> startTime; c
阅读全文
摘要：Original as below via recursion and will call the method itself for many times which is inefficient int Util::factorial54(int i) { if(i==0 ||i==1) { r
阅读全文
摘要：void Util::fib53(int *arr, int num, int &result) { arr[0]=0; arr[1]=1; for(int i=2;i<=num;i++) { arr[i]=arr[i-2]+arr[i-1]; } for(int i=0;i<=num;i++) {
阅读全文
摘要：void Util::getArray23(int *arr, int len) { srand(time(NULL)); for (int i = 0; i < len; i++) { arr[i] = rand(); } } void Util::printArray24(int *arr, i
阅读全文
摘要：void Util::logFile21(string fileName) { fstream wFile(fileName, ios::app); if (!wFile.is_open()) { cout << "Create or open " << fileName << " failed!"
阅读全文
摘要：void Util::getStructVector(vector<BookStruct> &vec, int len) { for (int i = 0; i < len; i++) { BookStruct bs; bs.BookIndex = i; bs.BookId = (unsigned
阅读全文
摘要：void Util::getArray23(int *arr, int len) { srand(time(NULL)); for (int i = 0; i < len; i++) { arr[i] = rand(); } } void Util::printArray24(int *arr, i
阅读全文
摘要：void Util::threadLambda170(int x, int y) { thread t1([](int x, int y) { auto result=pow(x,y); cout<<fixed<<"Pow="<<result<<endl; }, x, y); t1.join();
阅读全文
