![](https://img-blog.csdnimg.cn/20201014180756923.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
文章平均质量分 62
qq1997722
这个作者很懒,什么都没留下…
展开
-
12.Integer to Roman (第二周)
Integer to Roman - LeetCode Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999. Input: 1 Output: "I"原创 2017-09-13 23:07:44 · 193 阅读 · 0 评论 -
45. Jump Game II(第十六周)
Description Jump Game II - LeetCode Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump原创 2018-01-08 15:37:29 · 184 阅读 · 0 评论 -
236. Lowest Common Ancestor of a Binary Tree(第十五周)
Description Lowest Common Ancestor of a Binary Tree - LeetCode Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on W原创 2018-01-08 15:07:56 · 178 阅读 · 0 评论 -
451. Sort Characters By Frequency(第十二周)
Sort Characters By Frequency - LeetCode原创 2017-12-12 23:06:50 · 147 阅读 · 0 评论 -
238. Product of Array Except Self(第十三周)
Product of Array Except Self - LeetCode Given an array of n integers where n > 1,nums, return an array output such that output[i] is equal to the product of all the elements of nums excep原创 2017-12-12 23:35:56 · 141 阅读 · 0 评论 -
347. Top K Frequent Elements (第十四周)
Top K Frequent Elements - LeetCode Given a non-empty array of integers, return the k most frequent elements.For example, Given [1,1,1,2,2,3] and k = 2, return [1,2].Note: You may assume原创 2017-12-13 00:58:59 · 154 阅读 · 0 评论 -
121. Best Time to Buy and Sell Stock(第十一周)
Best Time to Buy and Sell Stock - LeetCode原创 2017-11-22 20:45:20 · 187 阅读 · 0 评论 -
415. Add Strings(第十周)
Add Strings - LeetCode Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.Note: The length of both num1 and num2 is < 5100.原创 2017-11-12 01:12:44 · 187 阅读 · 0 评论 -
66. Plus One(第六周)
Plus One - LeetCode Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.原创 2017-10-16 01:26:43 · 282 阅读 · 0 评论 -
74. Search a 2D Matrix(第七周)
Search a 2D Matrix - LeetCode Write an efficient algorithm that searches for a value in an m x n matrix.原创 2017-10-23 01:20:10 · 249 阅读 · 0 评论 -
217. Contains Duplicate(第八周)
Contains Duplicate - LeetCode Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array.原创 2017-10-30 22:26:33 · 131 阅读 · 0 评论 -
717. 1-bit and 2-bit Characters(第九周)
1-bit and 2-bit Characters - LeetCode We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).原创 2017-11-06 20:21:22 · 159 阅读 · 0 评论 -
344. Reverse String(第四周)
Description Reverse String - LeetCode Write a function that takes a string as input and returns the string reversed. Example: Given s = “hello”, return “olleh”.原创 2017-10-02 14:22:47 · 126 阅读 · 0 评论 -
58. Length of Last Word(第五周)
Length of Last Word - LeetCode Given a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string. For example, Given s = `"Hello World"`, retu原创 2017-10-08 16:16:38 · 132 阅读 · 0 评论 -
75. Sort Colors(第三周)
Description Sort Colors - LeetCode Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue原创 2017-09-24 18:00:02 · 324 阅读 · 0 评论 -
13. Roman to Integer (第一周)
Roman to Integer - LeetCode Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. Input: "DCXXI" Output: 621Solution原创 2017-09-10 16:50:54 · 333 阅读 · 0 评论 -
67. Add Binary(第十七周)
Description Add Binary - LeetCode Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". Solution 只需要模拟我们正常手算二进制加法的过程即可。首先是确定输出的长度原创 2018-01-08 16:04:21 · 192 阅读 · 0 评论