LeetCode/Java/709.java at master · strengthen/LeetCode · GitHub

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
__________________________________________________________________________________________________
0ms
class Solution {
    public String toLowerCase(String str) {
        /*//solution1
        str=str.toLowerCase();
        return str;*/

        /*solution2
        char[] newStr = str.toCharArray();
        for(int i = 0; i < newStr.length; i++)
        {
            if(newStr[i] >= 'A' && newStr[i] <= 'Z')
            {
                newStr[i] += 32;
            }
        }
        return new String(newStr);
        */

        //solution3
        if(str.length() == 1)
        {
            char tmp[] = str.toCharArray();
            if(tmp[0] >= 'A' && tmp[0] <= 'Z')
            {
                tmp[0] += 32;
            }
            return new String(tmp);
        }else{
            int mid = str.length()/2;
            String str1 = "", str2 = "";
            str1 = str.substring(0, mid);
            str2 = str.substring(mid);
            return toLowerCase(str1)+toLowerCase(str2);
        }
    }
}
__________________________________________________________________________________________________
sample 33272 kb submission
class Solution {
    public String toLowerCase(String str) {
        return Stream.of(str).map(String::toLowerCase).collect(Collectors.joining(""));

    }
}
__________________________________________________________________________________________________