Skip to content

feat: add solutions to lc problem: No.0543 #3911

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Dec 31, 2024
Merged

feat: add solutions to lc problem: No.0543 #3911

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
233 changes: 122 additions & 111 deletions solution/0500-0599/0543.Diameter of Binary Tree/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -56,7 +56,11 @@ tags:

<!-- solution:start -->

### 方法一
### 方法一：枚举 + DFS

我们可以枚举二叉树的每个节点，以该节点为根节点，计算其左右子树的最大深度 $\textit{l}$ 和 $\textit{r}$，则该节点的直径为 $\textit{l} + \textit{r}$。取所有节点的直径的最大值即为二叉树的直径。

时间复杂度 $O(n)$，空间复杂度 $O(n)$。其中 $n$ 为二叉树的节点个数。

<!-- tabs:start -->

Expand Down Expand Up @@ -106,7 +110,6 @@ class Solution {
private int ans;

public int diameterOfBinaryTree(TreeNode root) {
ans = 0;
dfs(root);
return ans;
}
Expand All @@ -115,10 +118,10 @@ class Solution {
if (root == null) {
return 0;
}
int left = dfs(root.left);
int right = dfs(root.right);
ans = Math.max(ans, left + right);
return 1 + Math.max(left, right);
int l = dfs(root.left);
int r = dfs(root.right);
ans = Math.max(ans, l + r);
return 1 + Math.max(l, r);
}
}
```
Expand All @@ -139,21 +142,20 @@ class Solution {
*/
class Solution {
public:
int ans;

int diameterOfBinaryTree(TreeNode* root) {
ans = 0;
int ans = 0;
auto dfs = [&](this auto&& dfs, TreeNode* root) -> int {
if (!root) {
return 0;
}
int l = dfs(root->left);
int r = dfs(root->right);
ans = max(ans, l + r);
return 1 + max(l, r);
};
dfs(root);
return ans;
}

int dfs(TreeNode* root) {
if (!root) return 0;
int left = dfs(root->left);
int right = dfs(root->right);
ans = max(ans, left + right);
return 1 + max(left, right);
}
};
```

Expand All @@ -168,19 +170,18 @@ public:
* Right *TreeNode
* }
*/
func diameterOfBinaryTree(root *TreeNode) int {
ans := 0
func diameterOfBinaryTree(root *TreeNode) (ans int) {
var dfs func(root *TreeNode) int
dfs = func(root *TreeNode) int {
if root == nil {
return 0
}
left, right := dfs(root.Left), dfs(root.Right)
ans = max(ans, left+right)
return 1 + max(left, right)
l, r := dfs(root.Left), dfs(root.Right)
ans = max(ans, l+r)
return 1 + max(l, r)
}
dfs(root)
return ans
return
}
```

Expand All @@ -202,19 +203,17 @@ func diameterOfBinaryTree(root *TreeNode) int {
*/

function diameterOfBinaryTree(root: TreeNode | null): number {
let res = 0;
const dfs = (root: TreeNode | null) => {
if (root == null) {
let ans = 0;
const dfs = (root: TreeNode | null): number => {
if (!root) {
return 0;
}
const { left, right } = root;
const l = dfs(left);
const r = dfs(right);
res = Math.max(res, l + r);
return Math.max(l, r) + 1;
const [l, r] = [dfs(root.left), dfs(root.right)];
ans = Math.max(ans, l + r);
return 1 + Math.max(l, r);
};
dfs(root);
return res;
return ans;
}
```

Expand Down Expand Up @@ -242,21 +241,90 @@ function diameterOfBinaryTree(root: TreeNode | null): number {
use std::cell::RefCell;
use std::rc::Rc;
impl Solution {
fn dfs(root: &Option<Rc<RefCell<TreeNode>>>, res: &mut i32) -> i32 {
if root.is_none() {
pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
let mut ans = 0;
fn dfs(root: Option<Rc<RefCell<TreeNode>>>, ans: &mut i32) -> i32 {
match root {
Some(node) => {
let node = node.borrow();
let l = dfs(node.left.clone(), ans);
let r = dfs(node.right.clone(), ans);

*ans = (*ans).max(l + r);

1 + l.max(r)
}
None => 0,
}
}
dfs(root, &mut ans);
ans
}
}
```

#### JavaScript

```js
/**
* Definition for a binary tree node.
* function TreeNode(val, left, right) {
* this.val = (val===undefined ? 0 : val)
* this.left = (left===undefined ? null : left)
* this.right = (right===undefined ? null : right)
* }
*/
/**
* @param {TreeNode} root
* @return {number}
*/
var diameterOfBinaryTree = function (root) {
let ans = 0;
const dfs = root => {
if (!root) {
return 0;
}
let root = root.as_ref().unwrap().as_ref().borrow();
let left = Self::dfs(&root.left, res);
let right = Self::dfs(&root.right, res);
*res = (*res).max(left + right);
left.max(right) + 1
const [l, r] = [dfs(root.left), dfs(root.right)];
ans = Math.max(ans, l + r);
return 1 + Math.max(l, r);
};
dfs(root);
return ans;
};
```

#### C#

```cs
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class Solution {
private int ans;

public int DiameterOfBinaryTree(TreeNode root) {
dfs(root);
return ans;
}

pub fn diameter_of_binary_tree(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
let mut res = 0;
Self::dfs(&root, &mut res);
res
private int dfs(TreeNode root) {
if (root == null) {
return 0;
}
int l = dfs(root.left);
int r = dfs(root.right);
ans = Math.Max(ans, l + r);
return 1 + Math.Max(l, r);
}
}
```
Expand All @@ -272,84 +340,27 @@ impl Solution {
* struct TreeNode *right;
* };
*/

#define max(a, b) (((a) > (b)) ? (a) : (b))

int dfs(struct TreeNode* root, int* res) {
if (!root) {
int dfs(struct TreeNode* root, int* ans) {
if (root == NULL) {
return 0;
}
int left = dfs(root->left, res);
int right = dfs(root->right, res);
*res = max(*res, left + right);
return max(left, right) + 1;
int l = dfs(root->left, ans);
int r = dfs(root->right, ans);
if (l + r > *ans) {
*ans = l + r;
}
return 1 + (l > r ? l : r);
}

int diameterOfBinaryTree(struct TreeNode* root) {
int res = 0;
dfs(root, &res);
return res;
int ans = 0;
dfs(root, &ans);
return ans;
}
```

<!-- tabs:end -->

<!-- solution:end -->

<!-- solution:start -->

### 方法二

<!-- tabs:start -->

#### Python3

```python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def diameterOfBinaryTree(self, root: TreeNode) -> int:
def build(root):
if root is None:
return
nonlocal d
if root.left:
d[root].add(root.left)
d[root.left].add(root)
if root.right:
d[root].add(root.right)
d[root.right].add(root)
build(root.left)
build(root.right)

def dfs(u, t):
nonlocal ans, vis, d, next
if u in vis:
return
vis.add(u)
if t > ans:
ans = t
next = u
for v in d[u]:
dfs(v, t + 1)

d = defaultdict(set)
ans = 0
next = root
build(root)
vis = set()
dfs(next, 0)
vis.clear()
dfs(next, 0)
return ans
```

<!-- tabs:end -->

<!-- solution:end -->

<!-- problem:end -->
Loading
Loading