上一页 1 2 3 4 5 6 7 8 ··· 14 下一页

2018年12月8日

摘要: Design a HashSet without using any built-in hash table libraries. To be specific, your design should include these functions: add(value): Insert a val 阅读全文
posted @ 2018-12-08 10:54 chiyeung 阅读(253) 评论(0) 推荐(0)
摘要: In a string S of lowercase letters, these letters form consecutive groups of the same character. For example, a string like S = "abbxxxxzyy" has the g 阅读全文
posted @ 2018-12-08 10:41 chiyeung 阅读(189) 评论(0) 推荐(0)

2018年12月7日

摘要: Given a binary tree, return the tilt of the whole tree. The tilt of a tree node is defined as the absolute difference between the sum of all left subt 阅读全文
posted @ 2018-12-07 12:06 chiyeung 阅读(232) 评论(0) 推荐(0)

2018年12月6日

摘要: Suppose Andy and Doris want to choose a restaurant for dinner, and they both have a list of favorite restaurants represented by strings. You need to h 阅读全文
posted @ 2018-12-06 23:46 chiyeung 阅读(175) 评论(0) 推荐(0)
摘要: Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Example 1: Example 2: Note:Your 阅读全文
posted @ 2018-12-06 23:35 chiyeung 阅读(157) 评论(0) 推荐(0)
摘要: Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文
posted @ 2018-12-06 05:39 chiyeung 阅读(236) 评论(0) 推荐(0)
摘要: Given scores of N athletes, find their relative ranks and the people with the top three highest scores, who will be awarded medals: "Gold Medal", "Sil 阅读全文
posted @ 2018-12-06 05:13 chiyeung 阅读(189) 评论(0) 推荐(0)

2018年12月5日

摘要: Given a 2D integer matrix M representing the gray scale of an image, you need to design a smoother to make the gray scale of each cell becomes the ave 阅读全文
posted @ 2018-12-05 15:48 chiyeung 阅读(184) 评论(0) 推荐(0)
摘要: Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a g 阅读全文
posted @ 2018-12-05 09:33 chiyeung 阅读(256) 评论(0) 推荐(0)
摘要: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-balanced binary tree is d 阅读全文
posted @ 2018-12-05 09:22 chiyeung 阅读(115) 评论(0) 推荐(0)
上一页 1 2 3 4 5 6 7 8 ··· 14 下一页

导航