Jimmy_Cheng - 博客园

2017年8月29日

LeetCode 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 @ 2017-08-29 06:55 Jimmy_Cheng 阅读(166) 评论(0) 推荐(0)

LeetCode 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 @ 2017-08-29 05:51 Jimmy_Cheng 阅读(195) 评论(0) 推荐(0)

2017年8月28日

LeetCode 120. Triangle （三角形）

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

posted @ 2017-08-28 11:08 Jimmy_Cheng 阅读(255) 评论(0) 推荐(0)

2017年8月27日

LeetCode 119. Pascal's Triangle II （杨辉三角之二）

摘要： Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3,Return [1,3,3,1]. Note:Could you optimize your algorithm to us 阅读全文

posted @ 2017-08-27 11:43 Jimmy_Cheng 阅读(267) 评论(0) 推荐(0)

LeetCode 118. Pascal's Triangle （杨辉三角）

摘要： Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5,Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ] 阅读全文

posted @ 2017-08-27 11:06 Jimmy_Cheng 阅读(343) 评论(0) 推荐(0)

LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal （用中序和后序树遍历来建立二叉树）

摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 题目标签：Array, 阅读全文

posted @ 2017-08-27 09:18 Jimmy_Cheng 阅读(268) 评论(0) 推荐(0)

LeetCode 105. Construct Binary Tree from Preorder and Inorder Traversal （用先序和中序树遍历来建立二叉树）

摘要： Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 题目标签：Array, T 阅读全文

posted @ 2017-08-27 07:20 Jimmy_Cheng 阅读(262) 评论(0) 推荐(0)

2017年8月26日

LeetCode 90. Subsets II （子集合之二）

摘要： Given a collection of integers that might contain duplicates, nums, return all possible subsets. Note: The solution set must not contain duplicate sub 阅读全文

posted @ 2017-08-26 07:58 Jimmy_Cheng 阅读(282) 评论(0) 推荐(0)

2017年8月2日

LeetCode 88. Merge Sorted Array（合并有序数组）

摘要： Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note:You may assume that nums1 has enough space (size tha 阅读全文

posted @ 2017-08-02 04:09 Jimmy_Cheng 阅读(256) 评论(0) 推荐(0)

LeetCode 81. Search in Rotated Sorted Array II（在旋转有序序列中搜索之二）

摘要： Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed? Would this affect the run-time complexity? How and why? Suppose an arra 阅读全文

posted @ 2017-08-02 00:11 Jimmy_Cheng 阅读(243) 评论(0) 推荐(0)

几米空间

听说10000小时可以超凡

公告