随笔分类 - 每周算法练习
摘要：题目：https://leetcode.com/problems/valid-palindrome/description/ Given a string, determine if it is a palindrome, considering only alphanumeric characte
阅读全文
摘要：题目链接： https://leetcode.com/problems/binary-tree-maximum-path-sum/description/ Given a non-empty binary tree, find the maximum path sum. For this probl
阅读全文
摘要：题目链接： https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/description/ Say you have an array for which the ith element is the price of a
阅读全文
摘要：题目：https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/description/ Say you have an array for which the ith element is the price of a giv
阅读全文
摘要：Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction
阅读全文
摘要：Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo
阅读全文
摘要：Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts from 0. In Pascal's trian
阅读全文
摘要：Given a non-negative integer numRows, generate the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers
阅读全文
摘要：Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL. Initially, all nex
阅读全文
摘要：Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its ne
阅读全文
摘要：Pick One Given a string S and a string T, count the number of distinct subsequences of S which equals T. A subsequence of a string is a new string whi
阅读全文
摘要：Given a binary tree, flatten it to a linked list in-place. For example, given the following tree: The flattened tree should look like: 将一个二叉树变成一个链表形式的
阅读全文
摘要：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. Note: A leaf is a node with no children. Exampl
阅读全文
摘要：Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. N
阅读全文
摘要：Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l
阅读全文
摘要：Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the dep
阅读全文
摘要：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced bina
阅读全文
摘要：Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d
阅读全文
摘要：Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For
阅读全文
摘要：Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example,
阅读全文
浙公网安备 33010602011771号