字符串翻转

public class Test {

 /**
  * @param args
  */
 public static void main(String[] args) {
  // TODO Auto-generated method stub
  System.out.println(fz("abcdefg"));
 }

 /**
  * 输入字符串abc输出字符创cba
  * 
  * @param s
  * @return
  */
 public static String fz(String s) {
  StringBuffer ss = new StringBuffer();
  String st[] = new String[s.length()];
  for (int i = 0; i < s.length(); i++) {
   st[i]=s.substring(i ,i+1);
  }
  for(int j=st.length-1;j>=0;j--){
   ss.append(st[j]);
  }
  return ss.toString();
 }
}

private static String ReverseStr(String Src)
{ 	
	if(Src.length() == 0){
	    return Src;
	}
	else{
	    return ReverseStr(Src.substring(1, Src.length())) + Src.substring(0,1);
	}	
}

private static String ReverseStrWithStack(String Src)
{
	Stack<Character> charstack=new Stack<Character>();
	for(int i=0;i<Src.length();i++)
	{
	    charstack.push(Src.charAt(i));
	}
	String rtn="";
	for(int i=0;i<Src.length();i++)
	{
	    rtn+=charstack.pop();  
	}
	return rtn;
}

  StringBuffer sb = new StringBuffer(str);
  return sb.reverse();

public static void TurnString() {
	String a ="abcdefg" ;
	StringBuffer b = new StringBuffer();
	for(int i=a.length()-1;i>=0;i--){
		b.append(a.charAt(i));
	}
	System.out.println(b.toString());
}

  StringBuffer sb = new StringBuffer(str);
  return sb.reverse();

   public  static  String Reverse3(String str)
	{
	    int count;
		count=str.length();
		char value[]= str.toCharArray(); 
		boolean hasSurrogate = false;
		int n = count - 1;
		for (int j = (n-1) >> 1; j >= 0; --j) {
		    char temp = value[j];
		    char temp2 = value[n - j];
		    if (!hasSurrogate) {
			hasSurrogate = (temp >= Character.MIN_SURROGATE && temp <= Character.MAX_SURROGATE)
			    || (temp2 >= Character.MIN_SURROGATE && temp2 <= Character.MAX_SURROGATE);
		    }
		    value[j] = temp2;
		    value[n - j] = temp;
		}
		if (hasSurrogate) {
		    // Reverse back all valid surrogate pairs
		    for (int i = 0; i < count - 1; i++) {
			char c2 = value[i];
			if (Character.isLowSurrogate(c2)) {
			    char c1 = value[i + 1];
			    if (Character.isHighSurrogate(c1)) {
				value[i++] = c1;
				value[i] = c2;
			    }
			}
		    }
		}
		return new String(value); 
	}