-
Notifications
You must be signed in to change notification settings - Fork 20
Expand file tree
/
Copy pathTrimString.java
More file actions
148 lines (106 loc) · 3.82 KB
/
TrimString.java
File metadata and controls
148 lines (106 loc) · 3.82 KB
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
// The MIT License (MIT)
//
// Copyright (c) 2022 Robert C. Seacord
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
package javaChar;
class TrimString {
private static String trim(String string) {
char ch;
int i;
for (i = 0; i < string.length(); i += 1) {
ch = string.charAt(i);
if (!Character.isLetter(ch)) {
break;
}
}
return string.substring(i);
}
public static void main(String[] args) {
String s = trim("Aß東999");
System.out.println(s);
s = trim("𐐀Aß東001");
System.out.println(s);
s = trim("𐐀𐐀𐐀𐐀𐐀𐐀𐐀𐐀1234567");
System.out.println(s);
}
}
// Simpler solution
// public static String trim(String string) {
// int i = 0;
// // For each code point in string. The codePoints() method returns
// // a stream of code point values from this sequence.
// // Any surrogate pairs encountered in the sequence are combined as
// // if by Character.toCodePoint and the result is passed to the stream.
// for (int ch : (Iterable<Integer>)string.codePoints()::iterator) {
// // determine if code point is character
// if (!Character.isLetter(ch)) {
// break;
// }
// i++;
// }
// // offsetByCodePoints returns the ith code point
// return string.substring(string.offsetByCodePoints(0, i));
// }
/*
// Fast solution
public static String trim(String string) {
boolean letterFound = false;
StringBuilder sb = new StringBuilder(string.length());
for (int ch : (Iterable<Integer>) string.codePoints()::iterator) {
if (nonLetterFound) {
sb.appendCodePoint(ch);
} else {
if (Character.isLetter(ch)) {
letterFound = true;
sb.appendCodePoint(ch);
}
}
}
return sb.toString();
}
// Simpler solution
public static String trim(String string) {
int i = 0;
// For each code point in string. The codePoints() method returns
// a stream of code point values from this sequence.
// Any surrogate pairs encountered in the sequence are combined as
// if by Character.toCodePoint and the result is passed to the stream.
for (int ch : (Iterable<Integer>)string.codePoints()::iterator) {
// determine if code point is character
if (!Character.isLetter(ch)) {
break;
}
i++;
}
// offsetByCodePoints returns the ith code point
return string.substring(string.offsetByCodePoints(0, i));
}
// Prestream solution
private static String trim(String string) {
int i;
for (i = 0; i < string.length(); i = string.offsetByCodePoints(i, 1)) {
int cp = string.codePointAt(i);
if (Character.isLetter(cp)) {
break;
}
}
return string.substring(i);
}
*/