Longest increasing subsequence: Difference between revisions

backPtr:='wrap(np){ return(np-1,if(np) piles[np-1].len()-1 else -1) }; // maybe (-1,-1)

foreach n in (ns){ newPile:=True; // create list of sorted lists

if(n<p[-1][0]){

p.del(1,-1) // only need the first and last elements