110平衡二叉树
判断左右子树高度是否相差超过1
使用递归
递归时判断左右子树高度相差超过1,则返回高度-1
如果左右子树高度存在-1,则仍返回-1.
如果左右子树平衡则返回左右子树高度中最大值+1.
class Solution {
public boolean isBalanced(TreeNode root) {
if (root==null){
return true;
}
return height(root)>-1;
}
public int height(TreeNode root) {
if (root==null){
return 0;
}
int leftd = height(root.left);
int rightd = height(root.right);
if (leftd==-1||rightd==-1|Math.abs(leftd-rightd)>1){
return -1;
}else {
return Math.max(leftd, rightd)+1;
}
}
}
257二叉树所有路径
返回所有从根节点到叶子节点的路径
我的题解:递归查找叶子节点,新建字符串存储叶子节点的值,并返回list索引数组。
最后将所有路径逆置
注意:存储的节点值和->都需逆置存储
class Solution {
public List<String> binaryTreePaths(TreeNode root) {
List<StringBuilder> result = new ArrayList<>();
treePaths(root, result);
List<String> res = new ArrayList<>();
for (StringBuilder stringBuilder : result) {
res.add(stringBuilder.reverse().toString());
}
return res;
}
List<Integer> treePaths(TreeNode root, List<StringBuilder> result){
if (root.left==null&&root.right==null){
StringBuilder s1 = new StringBuilder();
s1.append(new StringBuilder().append(root.val).reverse());
result.add(s1);
List<Integer> count = new ArrayList<Integer>();
count.add(result.size()-1);
return count;
}
List<Integer> list = new ArrayList<>();
if (root.left!=null){
list=treePaths(root.left, result);
}
if (root.right!=null){
list.addAll(treePaths(root.right, result));
}
for (Integer integer : list) {
result.get(integer).append(">-").append(new StringBuilder().append(root.val).reverse());
}
return list;
}
}
其他题解:递归+回溯
class Solution {
public List<String> binaryTreePaths(TreeNode root) {
List<String> res = new ArrayList<>();// 存最终的结果
if (root == null) {
return res;
}
List<Integer> paths = new ArrayList<>();// 存放中间路径
traversal(root, paths, res);
return res;
}
public void traversal(TreeNode t, List<Integer> paths, List<String> res) {
paths.add(t.val);
if (t.right == null && t.left == null) {
// 到达叶子节点,收集这条路径paths
StringBuilder sb = new StringBuilder();
for (int i = 0; i < paths.size() - 1; i++) {
sb.append(paths.get(i)).append("->");
}
sb.append(paths.get(paths.size() - 1));
res.add(sb.toString());
}
if (t.left != null) {
traversal(t.left, paths, res);
paths.remove(paths.size() - 1);// 回溯
}
if (t.right != null) {
traversal(t.right, paths, res);
paths.remove(paths.size() - 1);// 回溯
}
}
}
404左叶子之和
使用递归,如果左孩子存在:判断如果是左叶子,则value+左孩子值,否则继续递归
class Solution {
public int sumOfLeftLeaves(TreeNode root) {
int value = 0;
if (root.left!=null){
if (root.left.left==null&&root.left.right==null)
value += root.left.val;
else
value += sumOfLeftLeaves(root.left);
}
if (root.right!=null){
value += sumOfLeftLeaves(root.right);
}
return value;
}
}
收获
回溯思想需要灵活运用