这波去柬埔寨炒房的全完蛋了…# Money - 海外理财
h*i
1 楼
1)generate sentences similar to a given sentence.
Given a sentence (sequence of words), return a list of all possible
alternative sentences of the same length, where each pair of adjacent
words also occurs in the original sentence.
A simple example 'the cat and the mouse':
'and the cat and the', 'the cat and the mouse', 'the cat and the cat', 'cat
and the cat and'
这个用全排列,那复杂度太高了。
2)A palindrome is a string that is equal to its reverse (e.g., 'ana').
Compute the length of the longest palindrome that can be obtained by
deleting letters from |text|.
For example: the longest palindrome in 'animal' is 'ama'.
Your algorithm should run in O(len(text)^2) time.
不删除有算法,但删除麻烦了。
这个怎么用recursive的方法做呀?
非常感谢。
Given a sentence (sequence of words), return a list of all possible
alternative sentences of the same length, where each pair of adjacent
words also occurs in the original sentence.
A simple example 'the cat and the mouse':
'and the cat and the', 'the cat and the mouse', 'the cat and the cat', 'cat
and the cat and'
这个用全排列,那复杂度太高了。
2)A palindrome is a string that is equal to its reverse (e.g., 'ana').
Compute the length of the longest palindrome that can be obtained by
deleting letters from |text|.
For example: the longest palindrome in 'animal' is 'ama'.
Your algorithm should run in O(len(text)^2) time.
不删除有算法,但删除麻烦了。
这个怎么用recursive的方法做呀?
非常感谢。