java 字符串反转方法 java字符串反转函数汇总

java是一门面向对象编程语言，不仅吸收了c++语言的各种优点，还摒弃了c++里难以理解的多继承、指针等概念，以下是为大家分享的java常用字符串反转的.五种方案，供大家参考借鉴，欢迎浏览!

package erse;

import r;

public class run {

public run() {

("请输入一个字符串：");

scanner sc = new scanner();

string str = ();

n();

string reversedstrbyarray = new reverse(str).reversebyarray();

n("对应反转字符串为[array]："+ reversedstrbyarray);

string reversedstrbystack = new reverse(str).reversebystack();

n("对应反转字符串为[stack]："+ reversedstrbystack);

string reversedstrbysort = new reverse(str).reversebysort();

n("对应反转字符串为[逆序遍历]："+ reversedstrbysort);

string reversedstrbybit = new reverse(str).reversebybit();

n("对应反转字符串为[位运算]："+ reversedstrbybit);

string reversedstrbyrecursive = new reverse(str).reversebyrecursive(str);

n("对应反转字符串为[递归]："+ reversedstrbyrecursive); }

public static void main(string[] args) {

new run();

}

}

package erse;

import ;

public class reverse {

string str = new string();

public reverse(string str) {

= str;

}

//用数组实现

public string reversebyarray() {

if(str == null () == 0) {

return str;

}

int len = ();

char[] charray = array();

for(int i= 0; i< len/2; i++) {

char temp;

temp = charray[i];

charray[i] = charray[len- 1- i];

charray[len- 1- i] = temp;

}

return new string(charray);

}

//用栈实现

public string reversebystack() {

if(str == null () == 0) {

return str;

}

stack strstack = new stack();

char[] charray = array();

for(character ch: charray) {

(ch);

}

int len = ();

for(int i= 0; i< len; i++) { charray[i] = ();

}

return new string(charray);

}

//用逆序遍历实现

public string reversebysort() {

if(str == null () == 0) {

return str;

}

stringbuilder sb = new stringbuilder();

for(int i= ()- 1; i>= 0; i--) {

((i));

}

return ng();

}

//用位运算实现

public string reversebybit() {

if(str == null () == 0) {

return str;

}

char[] charray = array();

int len = ();

for(int i= 0; i< len/ 2; i++) {

charray[i]^= charray[len- 1- i];

charray[len- 1- i]^= charray[i];

charray[i]^= charray[len- 1- i];

}

return new string(charray);

}

//用递归实现

public string reversebyrecursive(string str) {

if(str == null () == 0) {

return str;

}

int len = ();

if(len == 1) {

return str;

} else {

return reversebyrecursive(ing(1))+ (0);

}

}

}

<

【java常用字符串反转的五种方案】相关文章：

java常用字符串介绍12-06java字符串(string)09-27java实现字符串倒序输出的常用方法11-27关于基于java字符串==与 equals11-24php的字符串常用函数09-12java判断字符串是否为数字的几个方法04-11java常用代码11-23java常用的语法错误12-06java常用快捷键03-08