|
33 | 33 | */
|
34 | 34 | public class _555 {
|
35 | 35 |
|
36 |
| - /** |
37 |
| - * credit: https://discuss.leetcode.com/topic/86477/neat-java-solution |
38 |
| - * and article: https://leetcode.com/articles/split-assembled-strings/#approach-3-optimized-solution-accepted |
39 |
| - */ |
40 |
| - public String splitLoopedString(String[] strs) { |
41 |
| - StringBuilder sb = new StringBuilder(); |
42 |
| - for (int i = 0; i < strs.length; i++) { |
43 |
| - sb.setLength(0); |
44 |
| - String reverse = sb.append(strs[i]).reverse().toString(); |
45 |
| - if (strs[i].compareTo(reverse) < 0) { |
46 |
| - strs[i] = reverse; |
| 36 | + public static class Solution1 { |
| 37 | + |
| 38 | + /** |
| 39 | + * credit: https://discuss.leetcode.com/topic/86477/neat-java-solution |
| 40 | + * and article: https://leetcode.com/articles/split-assembled-strings/#approach-3-optimized-solution-accepted |
| 41 | + */ |
| 42 | + public String splitLoopedString(String[] strs) { |
| 43 | + StringBuilder sb = new StringBuilder(); |
| 44 | + for (int i = 0; i < strs.length; i++) { |
| 45 | + sb.setLength(0); |
| 46 | + String reverse = sb.append(strs[i]).reverse().toString(); |
| 47 | + if (strs[i].compareTo(reverse) < 0) { |
| 48 | + strs[i] = reverse; |
| 49 | + } |
47 | 50 | }
|
48 |
| - } |
49 |
| - String result = ""; |
50 |
| - for (int i = 0; i < strs.length; i++) { |
51 |
| - sb.setLength(0); |
52 |
| - String reverse = sb.append(strs[i]).reverse().toString(); |
53 |
| - for (String str : new String[]{strs[i], reverse}) { |
54 |
| - for (int k = 0;
10000
k < str.length(); k++) { |
55 |
| - sb.setLength(0); |
56 |
| - sb.append(str.substring(k)); |
57 |
| - for (int j = i + 1; j < strs.length; j++) { |
58 |
| - sb.append(strs[j]); |
59 |
| - } |
60 |
| - for (int j = 0; j < i; j++) { |
61 |
| - sb.append(strs[j]); |
62 |
| - } |
63 |
| - sb.append(str.substring(0, k)); |
64 |
| - if (sb.toString().compareTo(result) > 0) { |
65 |
| - result = sb.toString(); |
| 51 | + String result = ""; |
| 52 | + for (int i = 0; i < strs.length; i++) { |
| 53 | + sb.setLength(0); |
| 54 | + String reverse = sb.append(strs[i]).reverse().toString(); |
| 55 | + for (String str : new String[]{strs[i], reverse}) { |
| 56 | + for (int k = 0; k < str.length(); k++) { |
| 57 | + sb.setLength(0); |
| 58 | + sb.append(str.substring(k)); |
| 59 | + for (int j = i + 1; j < strs.length; j++) { |
| 60 | + sb.append(strs[j]); |
| 61 | + } |
| 62 | + for (int j = 0; j < i; j++) { |
| 63 | + sb.append(strs[j]); |
| 64 | + } |
| 65 | + sb.append(str.substring(0, k)); |
| 66 | + if (sb.toString().compareTo(result) > 0) { |
| 67 | + result = sb.toString(); |
| 68 | + } |
66 | 69 | }
|
67 | 70 | }
|
68 | 71 | }
|
| 72 | + return result; |
69 | 73 | }
|
70 |
| - return result; |
71 | 74 | }
|
72 |
| - |
73 | 75 | }
|
0 commit comments