码迷,mamicode.com
首页 >  
搜索关键字:leetcode happy numbe    ( 36157个结果
leetcode validBST
算法:通过递归并限定上下限元素的值的范围可以计算package com.bupt.acm.leetcode;public class ValidBinary { private class TreeNode{ int val; TreeNode left; ...
分类:数据库   时间:2014-05-27 17:17:11    阅读次数:345
LeetCode: Two Sum 题解
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two nu...
分类:其他好文   时间:2014-05-26 19:50:39    阅读次数:314
poj2196
Specialized Four-Digit NumbersTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7238Accepted: 5285DescriptionFind and list all four-digit numbe...
分类:其他好文   时间:2014-05-26 19:18:49    阅读次数:250
【LeetCode】Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类:其他好文   时间:2014-05-26 18:46:20    阅读次数:251
[leetcode]Path Sum @ Python
原题地址:https://oj.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...
分类:编程语言   时间:2014-05-26 18:37:11    阅读次数:295
[leetcode]Unique Binary Search Trees II @ Python
原题地址:https://oj.leetcode.com/problems/unique-binary-search-trees-ii/题意:接上一题,这题要求返回的是所有符合条件的二叉查找树,而上一题要求的是符合条件的二叉查找树的棵数,我们上一题提过,求个数一般思路是动态规划,而枚举的话,我们就考...
分类:编程语言   时间:2014-05-26 18:30:01    阅读次数:256
LeetCode: palindromes 题解
Determine whether an integer is a palindrome. Do this without extra space.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinki...
分类:其他好文   时间:2014-05-26 18:07:52    阅读次数:217
LeetCode -- Triangle 路径求最小和( 动态规划问题)
LeetCode Problem-- Triangle 路径求最小和 动态规划问题...
分类:其他好文   时间:2014-05-25 21:33:33    阅读次数:246
【LeetCode】Single Number
原文: Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without ...
分类:其他好文   时间:2014-05-25 21:30:02    阅读次数:276
【leetcode】Minimum Window Substring
问题: 给定两个字符串,S,T,返回S中包含T中所有字符的最短的字串,若不存在,则返回"".时间复杂度为O(n)。 例如:S = "ADOBCODEBANC"           T = "ABC"          返回BANC 生活场景: 把问题具体化现实化一点。有n层楼,每层楼里放有一个物品,现在老板给你一个物品清单,里面是要你集齐的物品,你可以乘坐电梯,但是电梯只停一次,停在哪...
分类:Windows程序   时间:2014-05-25 21:27:17    阅读次数:438
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!