面试题:
- 逆转单词 翻转字符串里的单词
题目:给定一个字符串,逐个翻转字符串中的每个单词。
说明:- 无空格字符构成一个 单词 。
- 输入字符串可以在前面或者后面包含多余的空格,但是反转后的字符不能包括。
- 如果两个单词间有多余的空格,将反转后单词间的空格减少到只含一个。
示例1:
输入:“the sky is blue”
输出:“blue is sky the”
示例2:
输入:" hello world! "
输出:“world! hello”
解释:输入字符串可以在前面或者后面包含多余的空格,但是反转后的字符不能包括。
示例3:
输入:“a good example”
输出:“example good a”
解释:如果两个单词间有多余的空格,将反转后单词间的空格减少到只含一个。
示例4:
输入:s = " Bob Loves Alice "
输出:“Alice Loves Bob”
示例5:
输入:s = “Alice does not even like bob”
输出:“bob like even not does Alice”
提示:
1. 1 <= s.length <= 104
2. s 包含英文大小写字母、数字和空格 ' '
3. s 中 至少存在一个 单词
图示:
代码:
class Solution {
public String reverseWords(String s) {
if (s == null || s.trim().length() == 0) {
return "";
}
String[] words = s.split(" ");
StringBuilder answer = new StringBuilder();
for (int i = 0; i < words.length; ++i) {
answer.append(String.valueOf(' ') + reverseString(words[i]));
}
return answer.toString().trim();
}
public String reverseString(String s) {
String ans = "";
for (int i = s.length() - 1; i>= 0; i--) {
ans += String.valueOf(s.charAt(i));
}
return ans;
}
}
- 反转字符串中的单词 III
题目:给定一个字符串,你需要反转字符串中每个单词的字符顺序,同时仍保留空格和单词的初始顺序。
示例:输入:“Let’s take LeetCode contest”
输出:“s’teL ekat edoCteeL tsetnoc”
提示:
- 在字符串中,每个单词由单个空格分隔,并且字符串中不会有任何额外的空格。
图示:
代码:
class Solution {
public String reverseWords(String s) {
// write your code here
if (s == null || s.trim().length() == 0) {
return "";
}
String[] words = s.trim().split(" ");
StringBuilder sb = new StringBuilder();
for (int i = words.length - 1; i >= 0; i--) {
if(words[i].trim().equals("")) {
continue;
}
sb.append(words[i] + " ");
}
return sb.toString().trim();
}
}
- 整数转罗马数字
题目:
图示:
代码:
class Solution {
public String intToRoman(int n) {
String[] M = {"","M","MM","MMM"};
String[] C = {"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"};
String[] X = {"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};
String[] I = {"", "I","II","III","IV","V","VI","VII","VIII","IX"};
return M[n/1000] + C[(n/100) % 10] + X[(n/10) % 10] + I[n % 10];
}
}