leetcode
文章平均质量分 50
IT_LOVER_
这个作者很懒,什么都没留下…
展开
-
DP:about string
Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s =”aab”, Return [ [“aa”,”b”],原创 2017-10-02 19:31:26 · 301 阅读 · 0 评论 -
Given an array of non-negative integers, you are initially positioned at the first index of the arra
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. Your goal is to原创 2017-10-04 17:11:14 · 1669 阅读 · 0 评论