目录
一、N叉树的层序遍历
广度优先搜索
二、等差子数组
暴力
目录
一、N叉树的层序遍历
广度优先搜索
二、等差子数组
暴力
class Solution { public: vector> levelOrder(Node* root) { if(root == NULL) return {}; vector > ans; queue queue; queue.push(root); while(!queue.empty()){ int count = queue.size(); vector flag; for(int i = 0; i < count; i++){ Node* node = queue.front(); queue.pop(); flag.push_back(node->val); for(Node* child: node->children){ queue.push(child); } } ans.push_back(flag); } return ans; } };
class Solution { public: vectorcheckArithmeticSubarrays(vector & nums, vector & l, vector & r) { int n = l.size(); vector ans; for(int i = 0; i < n; i++){ vector flag; for(int m = l[i]; m <= r[i]; m++) flag.push_back(nums[m]); sort(flag.begin(), flag.end()); bool isTrue = true; int distance = flag[1] - flag[0]; for(int m = 2; m < flag.size(); m++){ if(flag[m] - flag[m - 1] != distance){ isTrue = false; break; } } ans.push_back(isTrue); } return ans; } };