mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 16:31:42 +08:00
存量题库数据更新
This commit is contained in:
@@ -14,15 +14,15 @@
|
||||
<p>Return <em>the longest <strong>ZigZag</strong> path contained in that tree</em>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
<p><strong class="example">Example 1:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2020/01/22/sample_1_1702.png" style="width: 221px; height: 383px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> root = [1,null,1,1,1,null,null,1,1,null,1,null,null,null,1,null,1]
|
||||
<strong>Input:</strong> root = [1,null,1,1,1,null,null,1,1,null,1,null,null,null,1]
|
||||
<strong>Output:</strong> 3
|
||||
<strong>Explanation:</strong> Longest ZigZag path in blue nodes (right -> left -> right).
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
<p><strong class="example">Example 2:</strong></p>
|
||||
<img alt="" src="https://assets.leetcode.com/uploads/2020/01/22/sample_2_1702.png" style="width: 157px; height: 329px;" />
|
||||
<pre>
|
||||
<strong>Input:</strong> root = [1,1,1,null,1,null,null,1,1,null,1]
|
||||
@@ -30,7 +30,7 @@
|
||||
<strong>Explanation:</strong> Longest ZigZag path in blue nodes (left -> right -> left -> right).
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
<p><strong class="example">Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> root = [1]
|
||||
|
Reference in New Issue
Block a user