上一页 1 2 3 4 5 6 7 ··· 14 下一页
  2018年8月15日
摘要: https://leetcode.com/problems/the-skyline-problem/description/ A city's skyline is the outer contour of the silhouette formed by all the buildings in 阅读全文
posted @ 2018-08-15 00:32 f91og 阅读(257) 评论(0) 推荐(0) 编辑
  2018年8月14日
摘要: Given a string s, you are allowed to convert it to a palindrome by adding characters in front of it. Find and return the shortest palindrome you can f 阅读全文
posted @ 2018-08-14 14:28 f91og 阅读(147) 评论(0) 推荐(0) 编辑
  2018年8月13日
摘要: https://leetcode.com/problems/word-search-ii/description/ Given a 2D board and a list of words from the dictionary, find all words in the board. Each 阅读全文
posted @ 2018-08-13 22:11 f91og 阅读(432) 评论(0) 推荐(0) 编辑
摘要: Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partitioning 阅读全文
posted @ 2018-08-13 02:40 f91og 阅读(174) 评论(0) 推荐(0) 编辑
摘要: Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k num 阅读全文
posted @ 2018-08-13 02:25 f91og 阅读(148) 评论(0) 推荐(0) 编辑
  2018年8月10日
摘要: Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Example 1: Example 2: 思路 可以遍历s1和s2所能构成的所有可能的interlaving string。 We start 阅读全文
posted @ 2018-08-10 00:42 f91og 阅读(302) 评论(0) 推荐(0) 编辑
  2018年8月8日
摘要: Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. Example: 思路 看了下discussion,真的很难理解 阅读全文
posted @ 2018-08-08 20:56 f91og 阅读(319) 评论(0) 推荐(0) 编辑
摘要: 1. Minimum Window Substring Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n 阅读全文
posted @ 2018-08-08 01:40 f91og 阅读(242) 评论(0) 推荐(0) 编辑
  2018年8月5日
摘要: 1. N-Queens The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, 阅读全文
posted @ 2018-08-05 16:58 f91og 阅读(225) 评论(0) 推荐(0) 编辑
摘要: Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. 阅读全文
posted @ 2018-08-05 15:06 f91og 阅读(378) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 ··· 14 下一页