冰凌花花～

2016年8月23日

摘要： Given a string S and a string T, count the number of distinct subsequences of T in S. A subsequence of a string is a new string which is formed from t 阅读全文

posted @ 2016-08-23 15:54 冰凌花花～阅读(190) 评论(0) 推荐(0) 编辑

Longest Common Subsequence

摘要： Given two strings, find the longest common subsequence (LCS). Your code should return the length of LCS. Clarification What's the definition of Longes 阅读全文

posted @ 2016-08-23 14:07 冰凌花花～阅读(160) 评论(0) 推荐(0) 编辑

Palindrome Partitioning II Leetcode

摘要： 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 @ 2016-08-23 11:33 冰凌花花～阅读(124) 评论(0) 推荐(0) 编辑

2016年8月22日

leetcode 解题报告 Word Break

摘要： Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For 阅读全文

posted @ 2016-08-22 16:19 冰凌花花～阅读(144) 评论(0) 推荐(0) 编辑

2016年8月21日

leetcode 72. Edit Distance

摘要： 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.) You have 阅读全文

posted @ 2016-08-21 17:29 冰凌花花～阅读(138) 评论(0) 推荐(0) 编辑

2016年8月20日

leetcode 55. Jump Game

摘要： 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 maxim 阅读全文

posted @ 2016-08-20 15:39 冰凌花花～阅读(250) 评论(0) 推荐(0) 编辑

2016年8月18日

leetcode 120. Triangle

摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文

posted @ 2016-08-18 20:01 冰凌花花～阅读(116) 评论(0) 推荐(0) 编辑

leetcode 64. Minimum Path Sum

摘要： Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path. 阅读全文

posted @ 2016-08-18 16:47 冰凌花花～阅读(134) 评论(0) 推荐(0) 编辑

leetcode 63. Unique Paths II

摘要： Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space 阅读全文

posted @ 2016-08-18 16:19 冰凌花花～阅读(144) 评论(0) 推荐(0) 编辑

leetcode 114. Flatten Binary Tree to Linked List

摘要： Given a binary tree, flatten it to a linked list in-place. For example,Given The flattened tree should look like: click to show hints. Hints: If you n 阅读全文

posted @ 2016-08-18 15:11 冰凌花花～阅读(172) 评论(0) 推荐(0) 编辑

公告