12 月 2022

Last Updated on 2022-12-14 by Clay

題目

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.

Last Updated on 2022-12-13 by Clay

題目

Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix.

Last Updated on 2022-12-12 by Clay

題目

You are climbing a staircase. It takes n steps to reach the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Last Updated on 2022-12-11 by Clay

題目

A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. Note that the path does not need to pass through the root.

Last Updated on 2022-12-10 by Clay

題目

Given the root of a binary tree, split the binary tree into two subtrees by removing one edge such that the product of the sums of the subtrees is maximized.

Last Updated on 2022-12-09 by Clay

題目

Given the root of a binary tree, find the maximum value v for which there exist different nodes a and b where v = |a.val - b.val| and a is an ancestor of b.

Last Updated on 2022-12-08 by Clay

題目

Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a leaf value sequence.