number-of-flowers-in-full-bloom

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given a 0-indexed 2D integer array <code>flowers</code>, where <code>flowers[i] = [starti, endi]</code> means the <code>ith</code> flower will be in full bloom from <code>starti</code> to <code>endi</code> (inclusive). You are also given a 0-indexed integer array <code>people</code> of size <code>n</code>, where <code>people[i]</code> is the time that the <code>ith</code> person will arrive to see the flowers.

Return an integer array <code>answer</code> of size <code>n</code>, where <code>answer[i]</code> is the number of flowers that are in full bloom when the <code>ith</code> person arrives.

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/ex1new.jpg" style="width: 550px; height: 216px;" />
<pre>
Input: flowers = [[1,6],[3,7],[9,12],[4,13]], people = [2,3,7,11]
Output: [1,2,2,2]
Explanation: The figure above shows the times when the flowers are in full bloom and when the people arrive.
For each person, we return the number of flowers in full bloom during their arrival.
</pre>

Example 2:
<img alt="" src="https://assets.leetcode.com/uploads/2022/03/02/ex2new.jpg" style="width: 450px; height: 195px;" />
<pre>
Input: flowers = [[1,10],[3,3]], people = [3,3,2]
Output: [2,2,1]
Explanation: The figure above shows the times when the flowers are in full bloom and when the people arrive.
For each person, we return the number of flowers in full bloom during their arrival.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= flowers.length &lt;= 5 * 104</code></li>
	<li><code>flowers[i].length == 2</code></li>
	<li><code>1 &lt;= starti &lt;= endi &lt;= 109</code></li>
	<li><code>1 &lt;= people.length &lt;= 5 * 104</code></li>
	<li><code>1 &lt;= people[i] &lt;= 109</code></li>
</ul>