[刷题]Space Replacement

[LintCode]Space Replacement

方法1 简单粗暴 不好

public class Solution {
    /**
     * @param string: An array of Char
     * @param length: The true length of the string
     * @return: The true length of new string
     */
    public int replaceBlank(char[] string, int length) {
        // 2015-07-18 O(n^2)
        // 效率低，有待改进
        if (string == null || length <= 0) {
            return 0;
        }
        for (int i = 0; i < length; i++) {
            if (string[i] == ' ') {
                for (int j = length - 1; j > i; j--) {
                    string[j + 2] = string[j];
                }
                string[i] = '%';
                string[i + 1] = '2';
                string[i + 2] = '0';
                length += 2;
            } 
        } 
        return length;
    }
} 

方法2 巧妙 好

public class Solution {
    /**
     * @param string: An array of Char
     * @param length: The true length of the string
     * @return: The true length of new string
     */
    public int replaceBlank(char[] string, int length) {
        // 2015-07-25 O(n)
        // string是一个很长很长的数组
        // length表示这个数组中字符串的长度
        if (string == null || string.length <= 0 || length <= 0 
                || string.length < length) {
            return -1;
        }
        // 第一次遍历 数一数有多少个空格
        int countOfSpace = 0; 
        for (int i = 0; i < length; i++) {
            if (string[i] == ' ') {
                countOfSpace++;
            }
        }
        int newlength = length + countOfSpace * 2;
        //第二次遍历 复制数组元素
        int indexLong = newlength - 1;
        int indexShort = length - 1;
        while (indexLong != indexShort) {
            if (string[indexShort] == ' ') {
                indexShort--;
                string[indexLong--] = '0';
                string[indexLong--] = '2';
                string[indexLong--] = '%';
            } else {
                string[indexLong--] = string[indexShort--];
            }
        }
        return newlength;
    }
}