摘要: Given an Android 3x3 key lock screen and two integers m and n, where 1 ≤ m ≤ n ≤ 9, count the total number of unlock patterns of the Android lock scre 阅读全文
posted @ 2016-07-26 23:43 北叶青藤 阅读(321) 评论(0) 推荐(0)
摘要: Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Example:Given n = 2, return 91. (The answer should be the 阅读全文
posted @ 2016-07-26 12:38 北叶青藤 阅读(172) 评论(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-07-26 10:37 北叶青藤 阅读(150) 评论(0) 推荐(0)
摘要: Given a binary tree, collect a tree's nodes as if you were doing this: Collect and remove all leaves, repeat until the tree is empty. Example:Given bi 阅读全文
posted @ 2016-07-26 01:03 北叶青藤 阅读(208) 评论(0) 推荐(0)
摘要: Given a non-negative number represented as a singly linked list of digits, plus one to the number. The digits are stored such that the most significan 阅读全文
posted @ 2016-07-26 00:25 北叶青藤 阅读(200) 评论(0) 推荐(0)