c/c++
auto0906
There is always hope
展开
-
最长回文序列与最长公共子序列(动态规划)
最长回文序列( Longest Palindromic Subsequence)转载 2015-05-17 15:29:23 · 492 阅读 · 0 评论 -
砝码称重:动态规划与母函数方法
砝码称重转载 2015-07-18 15:36:05 · 565 阅读 · 0 评论 -
Search in Rotated Sorted Array(leetcode)
Search_In_Rotated_Sorted_Array_1Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. I原创 2015-08-05 21:02:36 · 252 阅读 · 0 评论