forked from JojoYang666/Leetcode-1-300
-
Notifications
You must be signed in to change notification settings - Fork 0
/
_158_ReadNCharactersGivenRead4II_Callmultipletimes.java
68 lines (59 loc) · 2.09 KB
/
_158_ReadNCharactersGivenRead4II_Callmultipletimes.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
package leetcode_1To300;
/**
* 本代码来自 Cspiration,由 @Cspiration 提供
* 题目来源:http://leetcode.com
* - Cspiration 致力于在 CS 领域内帮助中国人找到工作,让更多海外国人受益
* - 现有课程:Leetcode Java 版本视频讲解(1-900题)(上)(中)(下)三部
* - 算法基础知识(上)(下)两部;题型技巧讲解(上)(下)两部
* - 节省刷题时间,效率提高2-3倍,初学者轻松一天10题,入门者轻松一天20题
* - 讲师:Edward Shi
* - 官方网站:https://cspiration.com
* - 版权所有,转发请注明出处
*/
public class _158_ReadNCharactersGivenRead4II_Callmultipletimes {
/**
* 158. Read N Characters Given Read4 II - Call multiple times
case :
abcd efgh igk 11
case 1 : n = 8 first time read 4 next count == 4 index == n
case 2 : n = 7 first time read 4 next count == 3 index == n
abcd efgh igk 11
n = 2 count = 4 buf[ab] pointer = 2 temp[abcd]
n = 3 index = 3 buf[cd] pointer = 0
temp[efgh] count = 4 buf[cde] pointer = 1
time : O(n);
space : O(1);
* @param buf Destination buffer
* @param n Maximum number of characters to read
* @return The number of characters read
*/
private int count = 0;
private int pointer = 0;
private char[] temp = new char[4];
public int read(char[] buf, int n) {
int index = 0;
while (index < n) {
if (pointer == 0) {
count = read4(temp);
}
if (count == 0) break;
while (index < n && pointer < count) {
buf[index++] = temp[pointer++];
}
if (pointer == count) pointer = 0;
}
return index;
}
//辅助函数,正常不是这么写
public int read4(char[] temp) {
char[] res = new char[10];
char[] ret = new char[4];
int index = 0;
for (int i = 0; i < res.length; i++) {
if (index < 4){
ret[index++] = temp[i];
}
}
return index;
}
}