683. K Empty Slots
来源:互联网 发布:手机qq2010 java版 编辑:程序博客网 时间:2024/06/07 14:57
There is a garden with N
slots. In each slot, there is a flower. The N
flowers will bloom one by one in N
days. In each day, there will be exactly
one flower blooming and it will be in the status of blooming since then.
Given an array flowers
consists of number from 1
to N
. Each number in the array represents the place where the flower will open in that day.
For example, flowers[i] = x
means that the unique flower that blooms at day i
will be at position x
, where i
and x
will be in the range from 1
to N
.
Also given an integer k
, you need to output in which day there exists two flowers in the status of blooming, and also the number of flowers between them is k
and these flowers are not blooming.
If there isn't such day, output -1.
Example 1:
Input: flowers: [1,3,2]k: 1Output: 2Explanation: In the second day, the first and the third flower have become blooming.
Example 2:
Input: flowers: [1,2,3]k: 1Output: -1
Note:
- The given array will be in the range [1, 20000].
import java.util.Arrays;class Solution { public int kEmptySlots(int[] a, int k) { int box = k+1, n = a.length/box+1;// if(a.length%box!=0)n++; int[] left = new int[n], right = new int[n]; Arrays.fill(left, -1); Arrays.fill(right, -1); for(int i=0; i<a.length; i++) { int idx = a[i] / box; if(left[idx] == -1)left[idx]=a[i]; else left[idx] = Math.min(left[idx], a[i]); if(right[idx] == -1)right[idx]=a[i]; else right[idx] = Math.max(right[idx], a[i]); if(idx > 0) { if(left[idx] - right[idx-1] == k+1) return i+1; } if(idx < n-1) { if(left[idx+1] - right[idx] == k+1) return i+1; } } return -1; }}
- 683. K Empty Slots
- 683. K Empty Slots
- LWC 51:683. K Empty Slots
- Qt public slots;protected slots;private slots
- empty()
- empty
- empty
- empty
- empty
- Signals & Slots
- Given a non-empty array of integers, return the k most frequent elements.
- Signals and Slots 翻译
- Private implementation slots
- Signals and Slots
- Slots in iPhone
- QT signal / slots 注意事项
- signal—slots 机制
- QT signals and slots
- Java Queue 和 Deque队列
- 双二极管钳位电路的原理
- 684. Redundant Connection
- Node.js读写中文内容文件操作
- 2017年全国大学生电子设计竞赛K题报告
- 683. K Empty Slots
- 【Java】:浮点型
- Longest Palindrome
- codeforces 836D(思维题)
- Visual Studio软件安装破解推荐网站
- 常见编程题
- Final、Static用法总结
- flask学习笔记
- 1785 数据流的算法(模拟)