轻风舞动

2018年9月8日

摘要： Given a non-empty array of non-negative integers nums, the degree of this array is defined as the maximum frequency of any one of its elements. Your t 阅读全文

posted @ 2018-09-08 06:33 轻风舞动阅读(466) 评论(0) 推荐(0)

Count the number of possible triangles

只有注册用户登录后才能阅读该文。阅读全文

posted @ 2018-09-08 03:22 轻风舞动阅读(2) 评论(0) 推荐(0)

2018年9月7日

Count number of substrings with exactly k distinct characters

只有注册用户登录后才能阅读该文。阅读全文

posted @ 2018-09-07 13:43 轻风舞动阅读(2) 评论(0) 推荐(0)

[LeetCode] 58. Length of Last Word 求末尾单词的长度

摘要： Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word 阅读全文

posted @ 2018-09-07 04:39 轻风舞动阅读(457) 评论(0) 推荐(0)

[LeetCode] 288.Unique Word Abbreviation 独特的单词缩写

摘要： An abbreviation of a word follows the form <first letter><number><last letter>. Below are some examples of word abbreviations: Assume you have a dicti 阅读全文

posted @ 2018-09-07 04:05 轻风舞动阅读(997) 评论(0) 推荐(0)

[LeetCode] 287. Find the Duplicate Number 寻找重复数

摘要： Given an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. 阅读全文

posted @ 2018-09-07 02:49 轻风舞动阅读(460) 评论(0) 推荐(0)

2018年9月4日

[LeetCode] 350. Intersection of Two Arrays II 两个数组相交II

摘要： Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2,2] Example 2: Input: n 阅读全文

posted @ 2018-09-04 14:22 轻风舞动阅读(573) 评论(0) 推荐(0)

[LeetCode] 349. Intersection of Two Arrays 两个数组相交

摘要： Given two arrays, write a function to compute their intersection. Example 1: Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [9,4] Exam 阅读全文

posted @ 2018-09-04 14:00 轻风舞动阅读(813) 评论(0) 推荐(0)

[LeetCode] 310. Minimum Height Trees 最小高度树

摘要： For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible roote 阅读全文

posted @ 2018-09-04 13:07 轻风舞动阅读(751) 评论(0) 推荐(0)

[LeetCode] 366. Find Leaves of Binary Tree 找二叉树的叶节点

摘要： Given a binary tree, find all leaves and then remove those leaves. Then repeat the previous steps until the tree is empty. Example:Given binary tree R 阅读全文

posted @ 2018-09-04 12:52 轻风舞动阅读(655) 评论(0) 推荐(0)

公告