鸭子船长

2017年6月14日

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

posted @ 2017-06-14 12:33 鸭子船长阅读(129) 评论(0) 推荐(0) 编辑

数组指针和指针数组的区别（转）

摘要：数组指针（也称行指针）定义 int (*p)[n];()优先级高，首先说明p是一个指针，指向一个整型的一维数组，这个一维数组的长度是n，也可以说是p的步长。也就是说执行p+1时，p要跨过n个整型数据的长度。如要将二维数组赋给一指针，应这样赋值：int a[3][4];int (*p)[4]; // 阅读全文

posted @ 2017-06-14 11:02 鸭子船长阅读(192) 评论(0) 推荐(0) 编辑

Distinct Subsequences（不同子序列的个数）——b字符串在a字符串中出现的次数、动态规划

摘要： Given a string S and a string T, count the number of distinct subsequences ofT inS. A subsequence of a string is a new string which is formed from the 阅读全文

posted @ 2017-06-14 00:00 鸭子船长阅读(2987) 评论(0) 推荐(0) 编辑

2017年6月13日

Populating Next Right Pointers in Each Node I, II——生成next树

摘要： 1、 Given a binary tree 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 N 阅读全文

posted @ 2017-06-13 18:16 鸭子船长阅读(156) 评论(0) 推荐(0) 编辑

Leetcode 118.119.杨辉三角pascals-triangleI、II——生成规律的三角形

摘要： 1、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-06-13 16:11 鸭子船长阅读(280) 评论(0) 推荐(0) 编辑

Leetcode 120. 三角形最小路径和Triangle 三角形——找出三角形中从上至下和最小的路 tag 数组动态规划

摘要： 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-06-13 16:03 鸭子船长阅读(183) 评论(0) 推荐(0) 编辑

Leetcode 121.122.123 买卖股票得最佳时机系列 best-time-to-buy-and-sell-stock系列——先买入后卖出股票的最大值 tag 数组

摘要： 1、 Say you have an array for which the i th element is the price of a given stock on day i . If you were only permitted to complete at most one transa 阅读全文

posted @ 2017-06-13 15:42 鸭子船长阅读(314) 评论(0) 推荐(0) 编辑

binary-tree-maximum-path-sum——二叉树任意一条路径上的最大值

摘要： Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example:Given the below binary tree, Return 6. 阅读全文

posted @ 2017-06-13 14:59 鸭子船长阅读(925) 评论(0) 推荐(0) 编辑

valid-palindrome——判断带符号数字字母的字符串是否为回文

摘要： Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example,"A man, a plan, a canal: Pan 阅读全文

posted @ 2017-06-13 12:40 鸭子船长阅读(340) 评论(0) 推荐(0) 编辑

Word Ladder II——找出两词之间最短路径的所有可能

摘要： Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that: For example, Given:start 阅读全文

posted @ 2017-06-13 12:21 鸭子船长阅读(454) 评论(0) 推荐(0) 编辑

公告