摘要：
Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000. Example 1:Input: Output 阅读全文
posted @ 2017-06-11 19:19
hellowOOOrld
阅读(176)
评论(0)
推荐(0)
摘要：
Given a string which consists of lowercase or uppercase letters, find the length of the longest palindromes that can be built with those letters. This 阅读全文
posted @ 2017-06-11 16:08
hellowOOOrld
阅读(174)
评论(0)
推荐(0)
摘要：
Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we tak 阅读全文
posted @ 2017-06-11 12:32
hellowOOOrld
阅读(345)
评论(0)
推荐(0)
摘要：
Design and implement a data structure for a compressed string iterator. It should support the following operations: next and hasNext. The given compre 阅读全文
posted @ 2017-06-11 12:13
hellowOOOrld
阅读(266)
评论(0)
推荐(0)
摘要：
Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are n 阅读全文
posted @ 2017-06-11 11:16
hellowOOOrld
阅读(1146)
评论(0)
推荐(0)
浙公网安备 33010602011771号