JSFiddle - React, Tailwind, and code Playground

by gschutz

JavaScript

var seq = [2,3,14,5,9,8,4];


function has(A) {
	var h = 0;
  
  function opt(i) {
  	return Math.max(A[i])
  }
  
  return opt(0);
}



function has2(A) {
	var h = 0;
  var lastadd = {};
  
  function opt(i) {
  	if (i == 0)
    	return 1;
  	var m = 0;
    var r1 = opt(i-1);
    
  	if (lastadd[i] > A[i]) {
    	lastadd[i] = 
    	return r1 + 1;
     } else {
     	return r1;
     }
  }
}