LeetCodeInHardWay/src/Problem_0102_levelOrder.cc at master · yinghaoyu/LeetCodeInHardWay · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#include <queue>
#include <utility>
#include <vector>

#include "UnitTest.h"

using namespace std;

struct TreeNode
{
  int val;
  TreeNode* left;
  TreeNode* right;
  TreeNode() : val(0), left(nullptr), right(nullptr) {}
  TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
  TreeNode(int x, TreeNode* left, TreeNode* right) : val(x), left(left), right(right) {}
};

class Solution
{
 public:
  vector<vector<int>> levelOrder(TreeNode* root)
  {
    vector<vector<int>> ans;
    if (root == nullptr)
    {
      return ans;
    }
    queue<TreeNode*> q;
    q.push(root);
    int n = 0;
    while (!q.empty())
    {
      n = q.size();
      vector<int> nodes;
      for (int i = 0; i < n; i++)
      {
        TreeNode* cur = q.front();
        q.pop();

        if (cur->left != nullptr)
        {
          q.push(cur->left);
        }
        if (cur->right != nullptr)
        {
          q.push(cur->right);
        }
        nodes.push_back(cur->val);
      }
      ans.emplace_back(nodes);
    }
    return ans;
  }
};

void testLevelOrder()
{
  Solution s;
  TreeNode* x5 = new TreeNode(7, nullptr, nullptr);
  TreeNode* x4 = new TreeNode(15, nullptr, nullptr);
  TreeNode* x3 = new TreeNode(20, x4, x5);
  TreeNode* x2 = new TreeNode(9, nullptr, nullptr);
  TreeNode* x1 = new TreeNode(3, x2, x3);
  vector<vector<int>> o1 = {{3}, {9, 20}, {15, 7}};

  TreeNode* y = new TreeNode(1, nullptr, nullptr);
  vector<vector<int>> o2 = {{1}};

  TreeNode* z = nullptr;
  vector<vector<int>> o3;

  EXPECT_TRUE(o1 == s.levelOrder(x1));
  EXPECT_TRUE(o2 == s.levelOrder(y));
  EXPECT_TRUE(o3 == s.levelOrder(z));
  EXPECT_SUMMARY;
}

int main()
{
  testLevelOrder();
  return 0;
}