03 2017 档案

摘要:初始版本 题目描述 Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 阅读全文
posted @ 2017-03-29 11:38 mrbean 阅读(228) 评论(0) 推荐(1)
摘要:题目描述 Reverse bits of a given 32 bits unsigned integer. For example, given input 43261596 (represented in binary as 00000010100101000001111010011100), 阅读全文
posted @ 2017-03-28 21:08 mrbean 阅读(113) 评论(0) 推荐(0)
摘要:题目概述 Given a set of distinct positive integers, find the largest subset such that every pair (Si, Sj) of elements in this subset satisfies: Si % Sj = 阅读全文
posted @ 2017-03-28 11:09 mrbean 阅读(146) 评论(0) 推荐(0)
摘要:题目描述 Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums = [ 阅读全文
posted @ 2017-03-25 20:33 mrbean 阅读(120) 评论(0) 推荐(0)
摘要:描述 Given two strings s and t, write a function to determine if t is an anagram of s. For example, s = "anagram", t = "nagaram", return true. s = "rat" 阅读全文
posted @ 2017-03-23 16:07 mrbean 阅读(132) 评论(0) 推荐(0)