PhDStillNeedLeetCode

Finally...it's my turn...

Anwsers to LeetCode. Also a practice of CMake and Google Test.
Please see ./problems for full list of solved problems.

How to Build

Prerequisites

• CMake 3.10 or later
• C++ compiler supports C++11

Build Steps

To build all problems along with test cases:

mkdir build && cd build
cmake .. && cmake --build . --target install
ctest -C debug      # Run all the test cases

Then all binary files will go to ./bin
To build without test cases, add -DT=OFF to cmake command.

To build a designated problem:

mkdir build && cd build
cmake -DQ=<problem number on LeetCode> .. && cmake --build . --target install

Then only one binary file will go to ./bin

How to Run

Each problem has a main function with a infinite while-loop. You can just input data as prompted and input EOF when you finish to exit elegantly (of course Ctrl-C is also a good and fast way to terminate).

Utility libraries can be used elsewhere

• utils/binary_tree.h - includes binary tree node definition and tree construction functions take different format as input so that you do not need to define it by yourself and write test cases faster.

How to input a binary tree?

The way to input a binary tree is almost identical to the way on LeetCode except that you need to use the integer -1 instead of null to represent a empty tree node.