cc ho老師找到提供的「最長子字串」演算法連結

 

The pseudo-code is show below:

func lis( a )
   initialize best to an array of 0's.
   for ( i from 1 to n )
     .....

Longest Increasing Subsequence - Algorithmist