Class Solution
- java.lang.Object
-
- g2001_2100.s2100_find_good_days_to_rob_the_bank.Solution
-
public class Solution extends Object
2100 - Find Good Days to Rob the Bank.Medium
You and a gang of thieves are planning on robbing a bank. You are given a 0-indexed integer array
security, wheresecurity[i]is the number of guards on duty on theithday. The days are numbered starting from0. You are also given an integertime.The
ithday is a good day to rob the bank if:- There are at least
timedays before and after theithday, - The number of guards at the bank for the
timedays beforeiare non-increasing , and - The number of guards at the bank for the
timedays afteriare non-decreasing.
More formally, this means day
iis a good day to rob the bank if and only ifsecurity[i - time] >= security[i - time + 1] >= ... >= security[i] <= ... <= security[i + time - 1] <= security[i + time].Return a list of all days (0-indexed) that are good days to rob the bank. The order that the days are returned in does not matter.
Example 1:
Input: security = [5,3,3,3,5,6,2], time = 2
Output: [2,3]
Explanation:
On day 2, we have security[0] >= security[1] >= security[2] <= security[3] <= security[4].
On day 3, we have security[1] >= security[2] >= security[3] <= security[4] <= security[5].
No other days satisfy this condition, so days 2 and 3 are the only good days to rob the bank.
Example 2:
Input: security = [1,1,1,1,1], time = 0
Output: [0,1,2,3,4]
Explanation: Since time equals 0, every day is a good day to rob the bank, so return every day.
Example 3:
Input: security = [1,2,3,4,5,6], time = 2
Output: []
Explanation:
No day has 2 days before it that have a non-increasing number of guards.
Thus, no day is a good day to rob the bank, so return an empty list.
Constraints:
1 <= security.length <= 1050 <= security[i], time <= 105
- There are at least
-
-
Constructor Summary
Constructors Constructor Description Solution()
-