Hash Table
konsy_dong
Java,C++,Python,linux
展开
-
LeetCode 202. Happy Number
题目: Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares原创 2017-04-04 16:22:09 · 244 阅读 · 0 评论 -
LeetCode 535. Encode and Decode TinyURL
题目: Note: This is a companion problem to the System Design problem: Design TinyURL. TinyURL is a URL shortening service where you enter a URL such as https://leetcode.com/problems/design-tinyurl and原创 2017-07-17 00:18:17 · 665 阅读 · 0 评论 -
LeetCode 594. Longest Harmonious Subsequence
题目: We define a harmonious array is an array where the difference between its maximum value and its minimum value is exactly 1.Now, given an integer array, you need to find the length of its longest h原创 2017-05-21 15:29:40 · 1156 阅读 · 0 评论 -
LeetCode 204. Count Primes
题目 : Count the number of prime numbers less than a non-negative number, n.思路: 求比n小的素数的个数,具体思路见程序注释。但是代码还需要优化~代码:class Solution { public: vector<int> pvec; int countPrimes(int n) { int原创 2017-04-12 13:56:39 · 265 阅读 · 0 评论 -
LeetCode 389. Find the Difference
题目: Given two strings s and t which consist of only lowercase letters. String t is generated by random shuffling string s and then add one more letter at a random position. Find the letter that was原创 2017-04-19 10:41:51 · 250 阅读 · 0 评论 -
LeetCode 274. H-Index
题目: Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher’s h-index.According to the definition of h-index on Wikipedia: “A原创 2017-04-19 10:22:46 · 306 阅读 · 0 评论 -
LeetCode 242. Valid Anagram
题目: 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”, t = “car”, return false.Note: You may assume原创 2017-04-18 16:45:07 · 246 阅读 · 0 评论 -
LeetCode 350. Intersection of Two Arrays II
题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: Each element in the result should appear as many times a原创 2017-04-18 16:15:41 · 241 阅读 · 0 评论 -
LeetCode 349. Intersection of Two Arrays
题目: Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].思路: 找出nums2与nums1相交的元素,若重复,则只要一个。 具体思路见代码代码:class Solution { pub原创 2017-04-04 16:28:05 · 475 阅读 · 0 评论 -
LeetCode 217. Contains Duplicate
题目描述: Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every elem原创 2017-04-10 15:17:15 · 211 阅读 · 0 评论 -
LeetCode 532. K-diff Pairs in an Array
题目: Given an array of integers and an integer k, you need to find the number of unique k-diff pairs in the array. Here a k-diff pair is defined as an integer pair (i, j), where i and j are both number原创 2017-04-09 11:25:36 · 746 阅读 · 0 评论 -
LeetCode 1. 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 use the sam原创 2017-04-09 11:21:11 · 323 阅读 · 0 评论 -
LeetCode 136. Single Number
题目: Given an array of integers, every eleme:nt appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without u原创 2017-03-17 11:41:45 · 270 阅读 · 0 评论 -
LeetCode 463. Island Perimeter
题目: You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is complet原创 2017-04-04 16:29:28 · 464 阅读 · 0 评论 -
LeetCode 500. 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. Example 1: Input: [“Hello”, “Alaska”, “Dad”, “Peace”]原创 2017-10-06 21:16:04 · 297 阅读 · 0 评论