上一页 1 ··· 3 4 5 6 7 8 9 10 11 12 下一页
摘要: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文
posted @ 2016-09-15 23:42 咖啡中不塌缩的方糖 阅读(101) 评论(0) 推荐(0) 编辑
摘要: Implement an iterator to flatten a 2d vector. For example,Given 2d vector = By calling next repeatedly until hasNext returns false, the order of eleme 阅读全文
posted @ 2016-09-15 23:10 咖啡中不塌缩的方糖 阅读(133) 评论(0) 推荐(0) 编辑
摘要: Given an encoded string, return it's decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is b 阅读全文
posted @ 2016-09-15 12:53 咖啡中不塌缩的方糖 阅读(326) 评论(0) 推荐(0) 编辑
摘要: Given a non-empty array of integers, return the k most frequent elements. For example,Given [1,1,1,2,2,3] and k = 2, return [1,2]. Note: You may assum 阅读全文
posted @ 2016-09-15 05:42 咖啡中不塌缩的方糖 阅读(208) 评论(0) 推荐(0) 编辑
摘要: Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Remov 阅读全文
posted @ 2016-09-15 05:13 咖啡中不塌缩的方糖 阅读(170) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2016-09-15 04:26 咖啡中不塌缩的方糖 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Given a positive integer num, write a function which returns True if num is a perfect square else False. Note: Do not use any built-in library functio 阅读全文
posted @ 2016-09-15 03:22 咖啡中不塌缩的方糖 阅读(459) 评论(0) 推荐(0) 编辑
摘要: Validate if a given string is numeric. Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => true Note: It is intended for the 阅读全文
posted @ 2016-09-15 02:26 咖啡中不塌缩的方糖 阅读(136) 评论(0) 推荐(0) 编辑
摘要: Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below 阅读全文
posted @ 2016-09-14 23:32 咖啡中不塌缩的方糖 阅读(115) 评论(0) 推荐(0) 编辑
摘要: Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence frombeginWord to endWord, s 阅读全文
posted @ 2016-09-14 23:03 咖啡中不塌缩的方糖 阅读(169) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 9 10 11 12 下一页
点击右上角即可分享
微信分享提示