leetcode/leetcode_872.cpp at master · zdevt/leetcode · 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
84
85
86

/*
 * =========================================================================
 *
 *       FileName:  leetcode_872.cpp
 *
 *    Description:
 *
 *        Version:  1.0
 *        Created:  2018-11-22 11:24:34
 *  Last Modified:  2018-11-22 11:24:59
 *       Revision:  none
 *       Compiler:  gcc
 *
 *         Author:  zt ()
 *   Organization:
 *
 * =========================================================================
 */

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stddef.h>
#include <string.h>
#include <signal.h>
#include <errno.h>
#include <unistd.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/socket.h>

#include <iostream>
#include <memory>
#include <algorithm>
#include <vector>
#include <thread>
#include <mutex>
#include <map>
#include <list>
#include <string>
#include <functional>

using namespace std;

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

class Solution
{
  public:
    bool leafSimilar ( TreeNode* root1, TreeNode* root2 )
    {
      function<string ( TreeNode* ) > f = [&] ( TreeNode * root )
      {
        string tmp;

        if ( !root )
          return tmp;

        if ( !root->left && !root->right )
          return to_string ( root->val );

        tmp = f ( root->left ) + f ( root->right );

        return tmp;
      };

      return f ( root1 ) == f ( root2 );
    }
};


int main ( int argc, char* argv[] )
{
  ( void ) argc;
  ( void ) argv;


  return 0;
}