longest-well-performing-interval

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

We are given <code>hours</code>, a list of the number of hours worked per day for a given employee.

A day is considered to be a tiring day if and only if the number of hours worked is (strictly) greater than <code>8</code>.

A well-performing interval is an interval of days for which the number of tiring days is strictly larger than the number of non-tiring days.

Return the length of the longest well-performing interval.

&nbsp;
Example 1:

<pre>
Input: hours = [9,9,6,0,6,6,9]
Output: 3
Explanation: The longest well-performing interval is [9,9,6].
</pre>

Example 2:

<pre>
Input: hours = [6,6,6]
Output: 0
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= hours.length &lt;= 104</code></li>
	<li><code>0 &lt;= hours[i] &lt;= 16</code></li>
</ul>

longestWPI

Longest Well-Performing Interval

Stack

Array

Hash Table

Prefix Sum

Monotonic Stack

给你一份工作时间表&nbsp;<code>hours</code>，上面记录着某一位员工每天的工作小时数。

我们认为当员工一天中的工作小时数大于&nbsp;<code>8</code> 小时的时候，那么这一天就是「劳累的一天」。

所谓「表现良好的时间段」，意味在这段时间内，「劳累的天数」是严格 大于「不劳累的天数」。

请你返回「表现良好时间段」的最大长度。

&nbsp;

示例 1：

<pre>
输入：hours = [9,9,6,0,6,6,9]
输出：3
解释：最长的表现良好时间段是 [9,9,6]。</pre>

示例 2：

<pre>
输入：hours = [6,6,6]
输出：0
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= hours.length &lt;= 104</code></li>
	<li><code>0 &lt;= hours[i] &lt;= 16</code></li>
</ul>