zoukankan      html  css  js  c++  java
  • Java字符串01-字符串反转输出

     方法一:

    字符串反转-利用交换的方式

    package com.clover.demo;
    
    import java.util.Arrays;
    
    public class Test_StringReverse_0810 {
        public static void main(String[] args) {
    //        思路:1.将字符串拆分为单个字符 2.查找中间位置 3.首尾相加=len 4.交换
            String line = "abcdef";
            char[] chs=line.toCharArray();//转换为字符数组
            System.out.println(Arrays.toString(chs));
            int a= chs.length;//字符数组的长度
            System.out.println(a);
            int start=0;
            int end=a-1;
            if(a%2!=0){
                //奇数
                //中位数的坐标
                int middle=(chs.length-1)/2;
                //交换
                for(int i=0;i<chs.length-1;i++){
                    if(i<middle){
                        char tmp = 0;
                        tmp=chs[i];
                        chs[i]=chs[chs.length-1-i];
                        chs[chs.length-1-i]= tmp;                    
                    }
                }        
            }else{
                //偶数
                //中间2位数的坐标
                int middle= chs.length/2;
                int middle_1=middle-1;
                char tmp = 0;
                tmp=chs[middle];
                chs[middle]=chs[middle_1];
                chs[middle_1]= tmp;    
                
                //交换
                for(int i=0;i<chs.length/2-1;i++){
                    if(i<middle_1){
                        char tmp1 = 0;
                        tmp1=chs[i];
                        chs[i]=chs[chs.length-1-i];
                        chs[chs.length-1-i]= tmp1;                    
                    }
                }
                }
            System.out.println(Arrays.toString(chs));
            
            }
        
        }

    方法二:

    字符串反转-利用倒着输出的方式

    package doudou;
    
    public class Test_Reverse_output {
        public static void main(String[] args) {
            String a="abcdefg123";
            char[] chs=a.toCharArray();
            System.out.println(chs);
            int b=chs.length;
            String result="";
            for(int i=b-1;i>=0;i--){
             result=result+chs[i];
             
            }
            System.out.println(result);
            }
    
    }

     方法三:

    字符串反转-利用StringBuffer的reverse()

    package doudou;
    
    public class test_Stringbuffer {
        public static void main(String[] args) {
            StringBuffer sb= new StringBuffer();
            sb.append("1111hfjdfhdhfdj");
            StringBuffer sb1=sb.reverse();
            System.out.println(sb1);    
        }
    }
  • 相关阅读:
    Codeforces Round #475 (Div. 1) B. Destruction of a Tree
    HDU
    HihoCoder
    浅谈spfa几个优化
    Codeforces Round #474 E. Alternating Tree
    Wannafly 挑战赛12 D
    2017 Multi-University Training Contest
    2017 Multi-University Training Contest
    斜率优化DP基础XVI Open Cup named after E.V. Pankratiev. GP of Ukraine.K
    斜率优化DP入门_HDU3507_Print Article
  • 原文地址:https://www.cnblogs.com/eosclover/p/13470084.html
Copyright © 2011-2022 走看看