码迷,mamicode.com
首页 >  
搜索关键字:determine    ( 2744个结果
LeetCode——Valid Palindrome
Description:Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, "A man, a plan, ...
分类:其他好文   时间:2015-06-19 22:59:13    阅读次数:165
LeetCode——Balanced Binary Tree
Description:Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in whi...
分类:其他好文   时间:2015-06-19 13:16:09    阅读次数:91
leetcode_Word Break
描述: Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = “leetcode”, dict = [“lee...
分类:其他好文   时间:2015-06-19 11:57:35    阅读次数:111
LeetCode91:Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total nu...
分类:其他好文   时间:2015-06-18 19:46:33    阅读次数:98
leetcode 9 -- Palindrome Number
题目 Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be palindromes? (ie, -1) If you are thinking of converting the integer to...
分类:其他好文   时间:2015-06-18 17:22:44    阅读次数:87
LeetCode112 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 given sum.Fo...
分类:其他好文   时间:2015-06-17 23:18:38    阅读次数:155
[LeetCode] Word Break
Word Break Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode",...
分类:其他好文   时间:2015-06-17 18:18:46    阅读次数:132
LeetCode之“数学”:Happy Number
题目链接 题目要求: Write an algorithm to determine if a number is "happy". A happy number is a number defined by the following process: Starting with any...
分类:移动开发   时间:2015-06-17 15:17:10    阅读次数:124
Lettcode_205_Isomorphic Strings
本文是在学习中的总结,欢迎转载但请注明出处:http://blog.csdn.net/pistolove/article/details/46530865 Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the characters in s can be replaced to get t. All occurrences of a ch...
分类:其他好文   时间:2015-06-17 11:35:30    阅读次数:123
Word Break
Given a stringsand a dictionary of wordsdict, determine ifscan be segmented into a space-separated sequence of one or more dictionary words.For exampl...
分类:其他好文   时间:2015-06-16 10:36:34    阅读次数:131
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!