-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMainClass.java
More file actions
87 lines (68 loc) · 2.52 KB
/
MainClass.java
File metadata and controls
87 lines (68 loc) · 2.52 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
package algrothm;
//everse Only Letters/Users/wr/Documents/GitHub/src/algrothm/MainClass.java
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
/**
* Created by wr on 2018/10/12.
*/
class Solution {
public String reverseOnlyLetters(String S) {
if(S.length() <= 1) return S;
char[] chars = S.toCharArray();
char[] res = new char[chars.length];
ArrayDeque<Character> stack = new ArrayDeque<Character>(chars.length);
for (int i = 0; i < chars.length; i++) {
if((chars[i] >= 'A' && chars[i] <= 'Z') || (chars[i] >= 'a' && chars[i]<='z')){
stack.push(chars[i]);
}else{
res[i] = chars[i];
}
}
for (int i = 0; i < chars.length; i++) {
if(res[i] == '\u0000'){
res[i] = stack.pop();
}
}
return new String(res);
}
}
class Solution1 {
public String reverseOnlyLetters(String st) {
int l = 0;
char[] s = st.toCharArray(); //把字符串转换成字符数组
int r = s.length-1;
while(l<r){
if(((s[l]>='A' && s[l]<='Z')||(s[l]>='a'&&s[l]<='z'))&&((s[r]>='A'&&s[r]<='Z')||(s[r]>='a'&&s[r]<='z'))){
//如果左右都是字母,则交换。
char temp = s[l];
s[l] = s[r];
s[r] = temp;
l++;r--;
}
else if(!((s[l]>='A'&&s[l]<='Z')||(s[l]>='a'&&s[l]<='z'))&&((s[r]>='A'&&s[r]<='Z')||(s[r]>='a'&&s[r]<='z')))
l++; //左边不是字母,左边做加一操作。
else if(((s[l]>='A'&&s[l]<='Z')||(s[l]>='a'&&s[l]<='z'))&&!((s[r]>='A'&&s[r]<='Z')||(s[r]>='a'&&s[r]<='z')))
r--; //右边不是字母,右边做减一操作。
else //都不是字母,则左加一右减一。
{
l++;
r--;
}
}
String ss = String.valueOf(s);
return ss;
}
}
public class MainClass {
public static void main(String[] args) throws IOException {
String S = "a-bC-dEf-ghIj";
String s = "Tesdsfsdf333t1ng-Leet=code-Q!";
String ret = new Solution().reverseOnlyLetters(S);
String ret1 = new Solution1().reverseOnlyLetters(s);
String out = (ret);
System.out.println(out);
System.out.println(ret1);
}
}