0515 solved.

liuyubobobo · liuyubobobo · commit a343ffb7a34e · 2022-06-23T11:37:57.000-07:00
diff --git a/0501-1000/0515-Find-Largest-Value-in-Each-Tree-Row/cpp-0515/CMakeLists.txt b/0501-1000/0515-Find-Largest-Value-in-Each-Tree-Row/cpp-0515/CMakeLists.txt
@@ -0,0 +1,6 @@
+cmake_minimum_required(VERSION 3.22)
+project(cpp_0515)
+
+set(CMAKE_CXX_STANDARD 14)
+
+add_executable(cpp_0515 main.cpp)
diff --git a/0501-1000/0515-Find-Largest-Value-in-Each-Tree-Row/cpp-0515/main.cpp b/0501-1000/0515-Find-Largest-Value-in-Each-Tree-Row/cpp-0515/main.cpp
@@ -0,0 +1,51 @@
+/// Source : https://leetcode.com/problems/find-largest-value-in-each-tree-row/
+/// Author : liuyubobobo
+/// Time   : 2022-06-23
+
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+
+/// DFS
+/// Time Complexity: O(n)
+/// Space Complexity: O(depth)
+
+/// Definition for a binary tree node.
+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<int> largestValues(TreeNode* root) {
+
+        vector<int> res;
+        dfs(root, 0, res);
+        return res;
+    }
+
+private:
+    void dfs(TreeNode* node, int depth, vector<int>& res){
+
+        if(!node) return;
+
+        if(depth == res.size()) res.push_back(node->val);
+        else res[depth] = max(res[depth], node->val);
+
+        dfs(node->left, depth + 1, res);
+        dfs(node->right, depth + 1, res);
+    }
+};
+
+
+int main() {
+
+    return 0;
+}
diff --git a/readme.md b/readme.md
@@ -544,6 +544,7 @@ email: [liuyubobobo@gmail.com](mailto:liuyubobobo@gmail.com)
 | | | | | | |
 | 513 | [Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/) | [无] | [C++](0501-1000/0513-Find-Bottom-Left-Tree-Value/cpp-0513/) | | |
 | | | | | | |
+| 515 | [Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/) | [无] | [C++](0501-1000/0515-Find-Largest-Value-in-Each-Tree-Row/cpp-0515/) | | |
 | 516 | [Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/) | [无] | [C++](0501-1000/0516-Longest-Palindromic-Subsequence/cpp-0516/) | | |
 | 517 | [Super Washing Machines](https://leetcode.com/problems/super-washing-machines/) | [solution](https://leetcode.com/problems/super-washing-machines/solution/) | [C++](0501-1000/0517-Super-Washing-Machines/cpp-0517/) | | |
 | 518 | [Coin Change 2](https://leetcode.com/problems/coin-change-2/description/) | [无] | [C++](0501-1000/0518-Coin-Change-2/cpp-0518/) | | |
