字符串算法题

字符串算法题
1. 将一个字符串进行反转，将字符串中的指定部分进行反转
abcdefg反转为abfedcg

public class Stringdeom {
    //方式1：先转换为char型数组
    public String reverse(String str, int startIndex, int endIndex){

        if (str !=null){
            char[] arr = str.toCharArray();
            for (int x = startIndex,y = endIndex; x < y; x++, y--) {
                char temp = arr[x];
                arr[x] = arr[y];
                arr[y] = temp;
            }
            return new String(arr);
        }
        return  null;

    }
    //方式2：使用string的拼接
    public String reverse2(String str, int startIndex, int endIndex){
        String reverseStr = str.substring(0, startIndex);
        for (int i = endIndex; i >= startIndex ; i--) {
            reverseStr += str.charAt(i);
            reverseStr += str.substring(endIndex + 1);

        }


        return  reverseStr;
    }
//方法3：使用StringBuffer/StringBuilder替换String 其中如果不是多线程问题首选Builder
    public String reverse3(String str, int startIndex, int endIndex){
        StringBuilder builder = new StringBuilder(str.length());//定义的长度和length的长度一样
        builder.append(str.substring(0,startIndex));//取前一个
        for (int i = endIndex; i >= startIndex ; i--) {
            builder.append(str.charAt(i));
        }
        builder.append(str.substring(endIndex + 1));


        return builder.toString();

    }
    @Test
    public  void Test(){
        String str ="abcdefg";
//        String a = reverse(str, 2,5);
        String b = reverse3(str,2,5);
        System.out.println(b);

    }

}

2.获取一个字符串在另一个字符串中出现的次数

/*
获取一个字符串在另一个字符串中出现的次数
 */
public class Test2 {
    public int getCount(String mainStr, String subStr){
       int mainLength = mainStr.length();
       int subLength = subStr.length();
       int count = 0;
       int index;
       if (mainLength >= subLength){
           //方式1
//如果要检索的字符串值没有出现，则indexOf方法返回 -1。
           while((index = mainStr.indexOf(subStr)) != -1){
               count++;//p476 8:47
               mainStr = mainStr.substring(index + subStr.length());
           }

           return count;
       }else{
           return 0;
       }
//方式2 while((index = mainStr.indexOf(subStr,0)) != -1){
// count++;
// index +=subLength;}
    }
    @Test
    public void Test(){
        String mainStr = "abkkcadkabkebfaabkskab";
        String subStr  = "ab";
        int count = getCount(mainStr, subStr);
        System.out.println(count);
    }

}

3获取两个额字符串中最大的相同子串，比如
str1 = “abcwerthelloyuiodef” str2 = “cvhellobnm”
提示：将短的那个串进行长度依次递减的字串与较长的串比较

/*
获取两个额字符串中最大的相同子串，比如
str1 = "abcwerthelloyuiodef" str2 = "cvhellobnm"
提示：将短的那个串进行长度依次递减的字串与较长的串比较
 */
public class Test3 {

    public String getlongString(String str1,String str2){
        String maxStr = (str1.length() >= str2.length())? str1:str2;
        String minStr = (str1.length() < str2.length())? str1:str2;
       int length = minStr.length();
        for (int i = 0; i < length; i++) {
            for (int x = 0, y = length - i; y <= length ; x++, y++) {
                String subStr = minStr.substring(x,y);
                if (maxStr.contains(subStr)){
                    return subStr;
                }
            }
        }
       
        return null;