LeetCode 158. Read N Characters Given Read4 II - Call multiple times（读文件流）

原题网址：https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times/

The API: int read4(char *buf) reads 4 characters at a time from a file.

The return value is the actual number of characters read. For example, it returns 3 if there is only 3 characters left in the file.

By using the read4 API, implement the function int read(char *buf, int n) that reads n characters from the file.

Note:
The read function may be called multiple times.

方法：

/* The read4 API is defined in the parent class Reader4.
      int read4(char[] buf); */

public class Solution extends Reader4 {
    private char[] read = new char[4];
    private int len = 0;
    /**
     * @param buf Destination buffer
     * @param n   Maximum number of characters to read
     * @return    The number of characters read
     */
    public int read(char[] buf, int n) {
        int pos = 0;
        while (n>0 && pos<len) {
            buf[pos] = read[pos];
            pos ++;
            n --;
        }
        for(int i=pos; i<len; i++) read[i-pos] = read[i];
        len = len - pos;
        while (n>0) {
            len = read4(read);
            if (len == 0) break;
            int r = 0;
            for(int i=0; i<len && n>0; i++) {
                buf[pos++] = read[i];
                n--;
                r++;
            }
            for(int i=0; i<len-r; i++) read[i] = read[i+r];
            len = len-r;
        }
        return pos;
    }
}

一个啰嗦一点的实现：

/* The read4 API is defined in the parent class Reader4.
      int read4(char[] buf); */

public class Solution extends Reader4 {
    private char[] buffer = new char[4];
    private int read = 0;
    /**
     * @param buf Destination buffer
     * @param n   Maximum number of characters to read
     * @return    The number of characters read
     */
    public int read(char[] buf, int n) {
        if (n <= 0) return 0;
        int r = 0;
        int pos = 0;
        if (read > 0) {
            int min = Math.min(read, n);
            System.arraycopy(buffer, 0, buf, 0, min);
            read -= min;
            n -= min;
            pos = min;
            if (read > 0) {
                for(int i=min; i<buffer.length; i++) {
                    buffer[i-min] = buffer[i];
                }
                return pos;
            }
        }
        while (n > 0) {
            read = read4(buffer);
            if (read == 0) break;
            int min = Math.min(read, n);
            System.arraycopy(buffer, 0, buf, pos, min);
            read -= min;
            n -= min;
            pos += min;
            if (read > 0) {
                for(int i=min; i<buffer.length; i++) {
                    buffer[i-min] = buffer[i];
                }
                return pos;
            }
        }
        return pos;
    }
}

疑似简洁版：

/* The read4 API is defined in the parent class Reader4.
      int read4(char[] buf); */

public class Solution extends Reader4 {
    private char[] memory = new char[4];
    private int read = 0;
    /**
     * @param buf Destination buffer
     * @param n   Maximum number of characters to read
     * @return    The number of characters read
     */
    public int read(char[] buf, int n) {
        int len = 0;
        while (n > 0) {
            int min = Math.min(read, n);
            if (min > 0) {
                System.arraycopy(memory, 0, buf, len, min);
                len += min;
                for(int i = 0; i < read - min; i++) {
                    memory[i] = memory[min + i];
                }
                read -= min;
                n -= min;
            }
            if (n == 0) break;
            read = read4(memory);
            if (read == 0) break;
        }
        return len;
    }
}