上一页 1 ··· 3 4 5 6 7 8 下一页
摘要: 题目描述 Given a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive. 题目大意 给一个区间[m, n],求该区间内所有元素按 阅读全文
posted @ 2019-06-10 11:24 你好哇傻小妞 阅读(105) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting ad 阅读全文
posted @ 2019-06-10 10:35 你好哇傻小妞 阅读(179) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. 题目 阅读全文
posted @ 2019-06-06 15:32 你好哇傻小妞 阅读(150) 评论(0) 推荐(0) 编辑
摘要: 题目描述 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stoppi 阅读全文
posted @ 2019-06-06 15:09 你好哇傻小妞 阅读(97) 评论(0) 推荐(0) 编辑
摘要: 题目描述 All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes usefu 阅读全文
posted @ 2019-06-05 14:14 你好哇傻小妞 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Given a list of non negative integers, arrange them such that they form the largest number. 题目大意 给定一个非零整数数组,将数组中的数字按照一定的顺序排列组成一个最大的数。 示例 E1 E2 解题 阅读全文
posted @ 2019-06-04 16:39 你好哇傻小妞 阅读(160) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return 阅读全文
posted @ 2019-05-31 14:46 你好哇傻小妞 阅读(271) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Given an integer n, return the number of trailing zeroes in n!. 题目大意 给定一个正整数n,计算n!的后缀有几个零。 示例 E1 E2 解题思路 因为在n!中每出现一个5就会产生一个零(5 * 2 = 10、15 * 12 = 阅读全文
posted @ 2019-05-31 14:17 你好哇傻小妞 阅读(84) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repe 阅读全文
posted @ 2019-05-30 21:04 你好哇傻小妞 阅读(122) 评论(0) 推荐(0) 编辑
摘要: 题目描述 Compare two version numbers version1and version2.If version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0. You may as 阅读全文
posted @ 2019-05-30 20:03 你好哇傻小妞 阅读(121) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 下一页