LeetCode-Solution
文章平均质量分 65
LeetCode-Solution
herongweiV
喜爱编程,热爱算法。
展开
-
【LeetCode】 476. Number Complement
【链接】:number complement 【描述】: Given a positive integer, output its complement number. The complement strategy is to flip the bits of its binary representation.Note: The given integer is guaranteed to原创 2017-02-09 16:13:22 · 617 阅读 · 0 评论 -
【LeetCode】338Counting Bits
【链接】:counting bits【描述】: Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their binary representation and return them as an array.Exa原创 2017-02-09 17:04:36 · 455 阅读 · 0 评论 -
【leetCode】001Two Sum
【链接】:Two Sum【描述】:Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not原创 2017-02-06 23:45:13 · 404 阅读 · 0 评论 -
【LeetCode】461Hamming Distance
【链接】:461Hamming Distance 【描述】: The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming dis原创 2017-02-08 11:15:17 · 531 阅读 · 0 评论 -
【LeetCode】496. Next Greater Element I
【链接】:next-greater-element-I 【描述】:You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1’s elements in the原创 2017-02-08 11:56:28 · 1734 阅读 · 0 评论 -
【LeetCode】500. Keyboard Row
【链接】:keyboard-row 【描述】: Given a List of words, return the words that can be typed using letters of alphabet on only one row’s of American keyboard like the image below. American keyboardExample 1:原创 2017-02-08 13:13:23 · 2419 阅读 · 0 评论