题解 | #反转字符串#
反转字符串
https://www.nowcoder.com/practice/c3a6afee325e472386a1c4eb1ef987f3
import java.util.*;
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
* 反转字符串
* @param str string字符串
* @return string字符串
*/
public String solve (String str) {
// write code here
char ck[] = str.toCharArray();
Stack<String> stack = new Stack<>();
for (char c : ck) {
// System.out.println(c+"");
stack.add(c + "");
}
String res[] = new String[ck.length];
int i = 0;
while (!stack.isEmpty()) {
res[i] = stack.pop();
System.out.println(res[i] + " " + i);
i++;
}
String result = Arrays.toString(res).replaceAll("[\\[\\],\\s]", "");;
return result;
}
}
使用栈,维护顺序,在遍历出来