贪心

跳跃游戏

function canJump(nums: number[]): boolean {
  const n = nums.length;
  let maxJump = 0;
  for (let i = 0; i < n; ++i) {
    if (i <= maxJump) {
      maxJump = Math.max(maxJump, i + nums[i]);
    }
  }
  return maxJump >= n - 1;
}

任务调度器

function leastInterval(tasks: string[], n: number): number {
  const taskCount = new Array<number>(26).fill(0);
  for (const task of tasks) {
    taskCount[task.charCodeAt(0) - 'A'.charCodeAt(0)] += 1;
  }
  const maxCount = Math.max(...taskCount);
  const maxCountTaskNum = taskCount.filter(
    value => value === maxCount
  ).length;
  return Math.max(
    (maxCount - 1) * (n + 1) + maxCountTaskNum,
    tasks.length
  );
}