qq_36234407的博客

#include <iostream> #include <random> #include <vector> #include <algorithm> using namespace std; void BubbleSort(vector<int> &nums) { int n = nums.size(); for (int i = 0; i < n - 1; i++) { for (int j

class BigNum{ public: static vector<int> addTwoVec(vector<int> a, vector<int> b) { int len_a = a.size(); int len_b = b.size(); vector<int> c; reverse(a.begin(), a.end()); reverse(b.begin()

一. 基本结构 class Tree { public: bool isWord; vector<Tree*> v; /** Initialize your data structure here. */ Trie() { isWord = false; v.resize(26); //元素个数 全体小写字母26个 } }; 1 需要返回单词string class Tree { public: