LeetCode
文章平均质量分 77
太阳是橘子
这个作者很懒,什么都没留下…
展开
-
LeetCode 728. Self Dividing Numbers
728. Self Dividing Numbers A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0,原创 2017-12-12 19:51:43 · 227 阅读 · 0 评论 -
LeetCode 56. Merge Intervals
56. Merge Intervals Given a collection of intervals, merge all overlapping intervals. For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18]. 思路分析: 第一步:应当将所给的intervals排序,即需原创 2017-12-12 20:11:26 · 270 阅读 · 0 评论 -
LeetCode 48. Rotate Image
48. Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in-place, which means you have to mo原创 2017-12-12 20:19:54 · 214 阅读 · 0 评论 -
LeetCode 693. Binary Number with Alternating Bits
693. Binary Number with Alternating Bits Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values. Example 1: Input: 5原创 2017-12-12 21:41:49 · 250 阅读 · 0 评论 -
804. Unique Morse Code Words
804. Unique Morse Code Words International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: “a” maps to “.-”, “b” maps to “-…”, “c” maps t...原创 2019-03-10 23:26:52 · 187 阅读 · 0 评论 -
944. Delete Columns to Make Sorted
944. Delete Columns to Make Sorted We are given an array A of N lowercase letter strings, all of the same length. Now, we may choose any set of deletion indices, and for each string, we delete all the...原创 2019-03-12 22:30:13 · 224 阅读 · 0 评论 -
933. Number of Recent Calls
933. Number of Recent Calls Write a class RecentCounter to count recent requests. It has only one method: ping(int t), where t represents some time in milliseconds. Return the number of pings that hav...原创 2019-03-12 23:29:23 · 273 阅读 · 0 评论