![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
leetcode
任志丰
这个作者很懒,什么都没留下…
展开
-
第五周 leetcode 3. Longest Substring Without Repeating Characters(Medium)
题目描述: Given a string, find the length of the longest substring without repeating characters.原创 2017-07-14 15:05:08 · 173 阅读 · 0 评论 -
第七周 leetcode 62. Unique Paths(Medium)
题目描述: A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below). The robot can only move either down or right at any point in time.原创 2017-07-14 19:34:51 · 252 阅读 · 0 评论 -
第九周 leetcode 72. Edit Distance(Hard)
题目描述: Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)原创 2017-07-14 20:08:31 · 288 阅读 · 0 评论 -
第三周 leetcode 102. Binary Tree Level Order Traversal(Medium)
题目描述: Given a binary tree, return the level order traversal of its nodes’ values.原创 2017-07-14 15:02:54 · 268 阅读 · 0 评论 -
第十一周 leetcode 135. Candy(Hard)
题目描述: There are N children standing in a line. Each child is assigned a rating value. What is the minimum candies you must give?原创 2017-07-14 22:56:25 · 228 阅读 · 0 评论 -
第十二周 leetcode 207. Course Schedule(Medium)
题目描述: There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expresse原创 2017-07-15 00:03:47 · 177 阅读 · 0 评论 -
第十三周 leetcode Add to List 55. Jump Game(Medium)
题目描述: 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 length at that position.原创 2017-07-15 00:13:46 · 399 阅读 · 0 评论 -
第十五周 leetcode 77. Combinations(Medium)
题目描述: Given two integers n and k, return all possible combinations of k numbers out of 1 … n原创 2017-07-15 00:45:13 · 365 阅读 · 0 评论 -
第十七周 leetcode 322. Coin Change(Medium)
题目描述: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of原创 2017-07-15 02:04:16 · 331 阅读 · 0 评论