Skip to content

Commit 65e7b57

Browse files
authored
Merge pull request gzc426#182 from ADemoDemo/master
1
2 parents 2e10c76 + 3c065a7 commit 65e7b57

File tree

2 files changed

+37
-0
lines changed

2 files changed

+37
-0
lines changed

2018.11.28-leetcode151/Avalon.md

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
public static String reverseWords(String input){
2+
3+
String[] arr = input.trim().split("\\s+");//"\\s+"
4+
int len = arr.length;
5+
/*
6+
String[] result = new String[len];
7+
for (int i = 0;i<len;i++){
8+
result[len-1-i] = arr[i];
9+
}
10+
return Arrays.toString(result);//[blue, is, sky, the]
11+
*/
12+
StringBuilder sb = new StringBuilder();
13+
for (int i = 0;i<len;i++){
14+
sb.append(arr[len-1-i]);
15+
if (len == 1){
16+
}else if(i<len-1)
17+
sb.append(" ");
18+
}
19+
return sb.toString();
20+
}

2018.11.29-leetcode443/Avalon.md

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
public static int compress(char[] chars) {
2+
Map<Character, String> map = new LinkedHashMap();
3+
int len = chars.length;
4+
for (int i = 0; i<len;i++){
5+
if (map.containsKey(chars[i])){
6+
map.put(chars[i],String.valueOf(Integer.parseInt(map.get(chars[i])) + 1));
7+
}else map.put(chars[i],"1");
8+
}
9+
int num = 0;
10+
for (Map.Entry<Character, String> entry : map.entrySet()) {
11+
num++;
12+
if (!entry.getValue().equals("1")){
13+
num += entry.getValue().toCharArray().length ;
14+
}
15+
}
16+
return num;
17+
}

0 commit comments

Comments
 (0)