slurm

2016年4月1日

leetcode @python 124. Binary Tree Maximum Path Sum

摘要：题目链接 "https://leetcode.com/problems/binary tree maximum path sum/" 题目原文 Given a binary tree, find the maximum path sum. For this problem, a path is de 阅读全文

posted @ 2016-04-01 19:06 slurm 阅读(344) 评论(0) 推荐(0) 编辑

leetcode @python 123. Best Time to Buy and Sell Stock III

摘要：题目链接 "https://leetcode.com/problems/best time to buy and sell stock iii/" 题目原文 Say you have an array for which the ith element is the price of a given 阅读全文

posted @ 2016-04-01 19:00 slurm 阅读(299) 评论(0) 推荐(0) 编辑

leetcode @python 122. Best Time to Buy and Sell Stock II

摘要：题目链接 "https://leetcode.com/problems/best time to buy and sell stock ii/" 题目原文 Say you have an array for which the ith element is the price of a given 阅读全文

posted @ 2016-04-01 18:57 slurm 阅读(184) 评论(0) 推荐(0) 编辑

leetcode @python 121. Best Time to Buy and Sell Stock

摘要：题目链接 "https://leetcode.com/problems/best time to buy and sell stock/" 题目原文 Say you have an array for which the ith element is the price of a given sto 阅读全文

posted @ 2016-04-01 18:52 slurm 阅读(181) 评论(0) 推荐(0) 编辑

2016年3月25日

leetcode @python 120. Triangle

摘要：题目链接 "https://leetcode.com/problems/triangle/" 题目原文 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent 阅读全文

posted @ 2016-03-25 11:37 slurm 阅读(128) 评论(0) 推荐(0) 编辑

leetcode @python 119. Pascal's Triangle II

摘要：题目链接 "https://leetcode.com/problems/pascals triangle ii/" 题目原文 Given an index k, return the kth row of the Pascal's triangle. For example, given k = 3 阅读全文

posted @ 2016-03-25 11:32 slurm 阅读(118) 评论(0) 推荐(0) 编辑

leetcode @python 118. Pascal's Triangle

摘要：题目链接 "https://leetcode.com/problems/pascals triangle/" 题目原文 Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows 阅读全文

posted @ 2016-03-25 11:29 slurm 阅读(208) 评论(0) 推荐(0) 编辑

leetcode @python 117. Populating Next Right Pointers in Each Node II.py

摘要：题目链接 "https://leetcode.com/problems/populating next right pointers in each node ii/" 题目原文题目大意和上一题类似，但是可能会有些节点没有左子树或者右子树解题思路使用层次遍历： 1. 临时节点指向根节点的左子阅读全文

posted @ 2016-03-25 11:25 slurm 阅读(399) 评论(0) 推荐(0) 编辑

leetcode @python 116. Populating Next Right Pointers in Each Node

摘要：题目链接 "https://leetcode.com/problems/populating next right pointers in each node/" 题目原文题目大意二叉树的每个节点都包含左子树和右子树，将同一层的子树用链表连接起来解题思路递归求解： 1.如果该节点有左子树：1 阅读全文

posted @ 2016-03-25 11:15 slurm 阅读(217) 评论(0) 推荐(0) 编辑

2016年3月17日

[leetcode] @python 115. Distinct Subsequences

摘要：题目链接 "https://leetcode.com/problems/distinct subsequences/" 题目原文 Given a string S and a string T, count the number of distinct subsequences of T in S. 阅读全文

posted @ 2016-03-17 16:27 slurm 阅读(201) 评论(0) 推荐(0) 编辑

Leetcode python

公告