![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode整理 HashTable
StudyCoder
这个作者很懒,什么都没留下…
展开
-
205. Isomorphic Strings
题目:Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced转载 2016-05-26 11:38:51 · 271 阅读 · 0 评论 -
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 app转载 2016-05-26 13:33:04 · 297 阅读 · 0 评论 -
36. Valid Sudoku
题目:Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character '.'.A partia转载 2016-05-26 14:57:46 · 223 阅读 · 0 评论 -
299. Bulls and Cows
题目:You are playing the following Bulls and Cows game with your friend: You write down a number and ask your friend to guess what the number is. Each time your friend makes a guess, you provide转载 2016-05-27 11:12:26 · 281 阅读 · 0 评论 -
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].Note:Each element in the result must be uniqu转载 2016-05-30 11:51:01 · 213 阅读 · 0 评论 -
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:Yo转载 2016-05-30 14:30:02 · 275 阅读 · 0 评论 -
290. Word Pattern
题目:Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word转载 2016-05-30 14:52:49 · 320 阅读 · 0 评论 -
204. Count Primes
题目:Description:Count the number of prime numbers less than a non-negative number, n.题意:统计小于非负整数n的素数的个数,素数不能被比它小的整数整除。思路:解题思路入提示二所示,埃拉托斯特尼筛法Sieve of Eratosthenes中,算法过程如下图所示,我们从2开始转载 2016-05-27 08:56:25 · 241 阅读 · 0 评论 -
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 th转载 2016-05-27 10:19:27 · 274 阅读 · 0 评论