上一页 1 ··· 10 11 12 13 14 15 16 17 18 ··· 27 下一页
摘要: Design a logger system that receive stream of messages along with its timestamps, each message should be printed if and only if it is not printed in t 阅读全文
posted @ 2017-11-07 05:51 Jimmy_Cheng 阅读(338) 评论(0) 推荐(0) 编辑
摘要: 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 elemen 阅读全文
posted @ 2017-11-07 05:34 Jimmy_Cheng 阅读(162) 评论(0) 推荐(0) 编辑
摘要: 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 i 阅读全文
posted @ 2017-11-07 02:45 Jimmy_Cheng 阅读(174) 评论(0) 推荐(0) 编辑
摘要: 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 lette 阅读全文
posted @ 2017-11-06 08:11 Jimmy_Cheng 阅读(261) 评论(0) 推荐(0) 编辑
摘要: Given a string, determine if a permutation of the string could form a palindrome. For example,"code" -> False, "aab" -> True, "carerac" -> True. 题目标签: 阅读全文
posted @ 2017-11-06 07:07 Jimmy_Cheng 阅读(281) 评论(0) 推荐(0) 编辑
摘要: Given a string, we can "shift" each of its letter to its successive letter, for example: "abc" -> "bcd". We can keep "shifting" which forms the sequen 阅读全文
posted @ 2017-11-05 06:26 Jimmy_Cheng 阅读(416) 评论(0) 推荐(0) 编辑
摘要: A strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Write a function to determine if a number i 阅读全文
posted @ 2017-11-04 08:12 Jimmy_Cheng 阅读(350) 评论(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", t = 阅读全文
posted @ 2017-11-02 05:58 Jimmy_Cheng 阅读(355) 评论(0) 推荐(0) 编辑
摘要: 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 occurrenc 阅读全文
posted @ 2017-10-27 11:40 Jimmy_Cheng 阅读(324) 评论(0) 推荐(0) 编辑
摘要: Description: Count the number of prime numbers less than a non-negative number, n. 题目标签:Hash Table 题目给了我们一个n, 让我们找出比n小的 质数的数量。 因为这道题目有时间限定,不能用常规的方法。 首 阅读全文
posted @ 2017-10-27 07:08 Jimmy_Cheng 阅读(342) 评论(0) 推荐(0) 编辑
上一页 1 ··· 10 11 12 13 14 15 16 17 18 ··· 27 下一页