2014年12月5日
【LeetCode】162. Find Peak Element (3 solutions)
摘要： Find Peak ElementA peak element is an element that is greater than its neighbors.Given an input array wherenum[i] ≠ num[i+1], find a peak element and ... 阅读全文
posted @ 2014-12-05 23:16 陆草纯 阅读(4721) 评论(0) 推荐(0) 编辑
【LeetCode】89. Gray Code (2 solutions)
摘要： Gray CodeThe gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integernrepresenting the tot... 阅读全文
posted @ 2014-12-05 15:41 陆草纯 阅读(734) 评论(0) 推荐(0) 编辑
【LeetCode】78. Subsets (2 solutions)
摘要： SubsetsGiven a set of distinct integers,S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must... 阅读全文
posted @ 2014-12-05 11:22 陆草纯 阅读(261) 评论(0) 推荐(0) 编辑