码迷,mamicode.com
首页 >  
搜索关键字:problems    ( 6275个结果
Populating Next Right Pointers in Each Node Total Accepted: 46429 Total Submissions: 128383
题目来自:LeetCode https://leetcode.com/problems/populating-next-right-pointers-in-each-node/ Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; ...
分类:其他好文   时间:2015-04-23 13:22:50    阅读次数:143
HDU 1981 A Special Text Editor
Problem DescriptionAfter AC all the hardest problems in the world , the ACboy 8006 now has nothing to do . So he develops a special text editor.The te...
分类:其他好文   时间:2015-04-22 20:28:49    阅读次数:204
Minimum Path Sum Total Accepted: 34975 Total Submissions: 109325
题目来自于:LeetCode https://leetcode.com/problems/minimum-path-sum/ Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of...
分类:其他好文   时间:2015-04-22 18:20:03    阅读次数:115
Binary Tree Right Side View
https://leetcode.com/problems/binary-tree-right-side-view/Given a binary tree, imagine yourself standing on therightside of it, return the values of t...
分类:其他好文   时间:2015-04-22 17:43:52    阅读次数:95
Clone Graph
https://leetcode.com/problems/clone-graph/Clone an undirected graph. Each node in the graph contains alabeland a list of itsneighbors.OJ's undirected ...
分类:其他好文   时间:2015-04-22 17:38:19    阅读次数:117
Master the 10 Most Common Python Programming Problems - 10大最常见的Python编程错误
Introduction 本文介绍python编程中很难捕捉10大错误 (Note: This article is intended for a more advanced audience than Common Mistakes of Python Programmers, which is geared(适合) more toward those who are new...
分类:编程语言   时间:2015-04-21 20:43:40    阅读次数:245
Path Sum Total Accepted: 50216 Total Submissions: 168425
题目来自于leetcode https://leetcode.com/problems/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 ...
分类:其他好文   时间:2015-04-21 18:05:43    阅读次数:156
Pow(x, n)
https://leetcode.com/problems/powx-n/Implement pow(x,n).解题思路:这种math的题目本来就不擅长,看到题目tag里有binary search,很是疑问,不知道怎么解。直接写网友的思路吧,其实就是递归。对幂数n折半递归,递归结束的条件为n达到0...
分类:其他好文   时间:2015-04-21 17:58:31    阅读次数:116
Leetcode Palindrome Partitioning II
题目地址:https://leetcode.com/problems/palindrome-partitioning-ii/题目解析:此问题可以使用动态规划,用一个数组保存前i个字符需要的最少cut数,前i+1个字符串的最小cut数为前j个字符所需的cut数(j+1到i个字符为回文)+1;题目解答:...
分类:其他好文   时间:2015-04-21 01:40:04    阅读次数:98
目标跟踪之卡尔曼滤波---理解Kalman滤波的使用预测
Kalman滤波简介 Kalman滤波是一种线性滤波与预测方法,原文为:A New Approach to Linear Filtering and Prediction Problems。文章推导很复杂,看了一半就看不下去了,既然不能透彻理解其原理,但总可以通过实验来理解其具体的使用方法。 K.....
分类:其他好文   时间:2015-04-20 22:07:36    阅读次数:314
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!