lpomeloz

2019年6月10日

摘要： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Note: For the purpose of this problem, w 阅读全文

posted @ 2019-06-10 17:23 lpomeloz 阅读(102) 评论(0) 推荐(0) 编辑

letecode [122] - Best Time to Buy and Sell Stock II

摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文

posted @ 2019-06-10 16:00 lpomeloz 阅读(120) 评论(0) 推荐(0) 编辑

letecode [121] - Best Time to Buy and Sell Stock

摘要： 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 阅读全文

posted @ 2019-06-10 11:27 lpomeloz 阅读(144) 评论(0) 推荐(0) 编辑

letecode [119] - Pascal's Triangle II

摘要： 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 阅读全文

posted @ 2019-06-10 10:04 lpomeloz 阅读(131) 评论(0) 推荐(0) 编辑

2019年6月9日

letecode [118] - Pascal's Triangle

摘要： 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 阅读全文

posted @ 2019-06-09 21:13 lpomeloz 阅读(112) 评论(0) 推荐(0) 编辑

letecode [112] - Path Sum

摘要： 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 阅读全文

posted @ 2019-06-09 20:49 lpomeloz 阅读(142) 评论(0) 推荐(0) 编辑

letecode [111] - Minimum Depth of Binary Tree

摘要： 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 阅读全文

posted @ 2019-06-09 17:36 lpomeloz 阅读(130) 评论(0) 推荐(0) 编辑

letecode [110] - Balanced Binary Tree

摘要： 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 阅读全文

posted @ 2019-06-09 15:56 lpomeloz 阅读(145) 评论(0) 推荐(0) 编辑

letecode [108] - Convert Sorted Array to Binary Search Tree

摘要： 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 阅读全文

posted @ 2019-06-09 15:21 lpomeloz 阅读(121) 评论(0) 推荐(0) 编辑

letecode [107] - Binary Tree Level Order Traversal II

摘要： 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 阅读全文

posted @ 2019-06-09 11:20 lpomeloz 阅读(109) 评论(0) 推荐(0) 编辑

公告