non overlapping segments

greedyalgorithm.js

function solution(A, B) {
    // write your code in JavaScript (Node.js 8.9.4)
    
    if(A.length === 1 ){
        return 1;
    } else if(A.length ===0){
        return 0;
    }
    let nonOverlapping = 1;
    let prevEnd = B[0];
    
    for (let curr = 1; curr < A.length; curr++){
        if (A[curr] > prevEnd){
            nonOverlapping++;
            prevEnd = B[curr];
        }
    }
    
    return nonOverlapping;
}
try {
  const A = [1,3,7,9,9];
  const B = [5,6,8,9,10];
  console.log(solution(A,B));
  
}catch(err){console.log(err)}