字符串相关算法题

《剑指offer》相关题目

《剑指offer》系列 替换空格（Java）

LeetCode 相关题目

3. 无重复字符的最长子串

class Solution {
    public int lengthOfLongestSubstring(String s) {
        if (s == null || s.length() == 0) {
            return 0;
        }
        boolean[] chars = new boolean[256]; // 256 ASCII code
        int rst = 0;
        int start = 0;
        int end = 0;
        while (start < s.length()) {
            while (end < s.length() && !chars[s.charAt(end)]) {
                chars[s.charAt(end)] = true;
                rst = Math.max(rst, end - start + 1);
                end++;
            }
            //将下标为start的字符变为false，表示没访问过
            chars[s.charAt(start)] = false;
            start++;
        }
        return rst;
    }
}

415. 字符串相加

class Solution {
    public String addStrings(String num1, String num2) {
        int i = num1.length() - 1, j = num2.length() - 1;
        int carry = 0;
        StringBuilder stringBuilder = new StringBuilder();
        while (i >= 0 || j >= 0 || carry != 0) {
            int x = i >= 0 ? num1.charAt(i) - '0' : 0;
            int y = j >= 0 ? num2.charAt(j) - '0' : 0;
            int result = x + y + carry;
            stringBuilder.append(result % 10);
            carry = result / 10;
            i--;
            j--;
        }
        return stringBuilder.reverse().toString();
    }
}