JAVA 回文字符串判断+字典序

第一种：

public static boolean isHuiwen(String str) {
		boolean result = true;
		for(int i=0;i<str.length();i++) {
			if(str.charAt(i) != str.charAt(str.length()-1-i)) {
				result = false;
				break;
			}
		}
		return result;
	}

第二种：

public static boolean isHuiwen1(String str) {
		String temp ="";
		for (int i = 0; i < str.length(); i++) {
			temp = str.charAt(i)+temp;
		}
		return str.equals(temp);
		
	}

第三种：深度：判断String st r= "wangwei,haha,ww,ww,haha,wangwei"是不是回文字符串：

package com.lanou.test;

public class DuiCheng {
	private String str;

	public DuiCheng(String str) {
		this.str = str;
	}

	private boolean dui() {
		String[] array;
		boolean flag = true;
		if (str.indexOf(',') > 0) {
			array = str.split(",");
		} else {
			array = str.split("");
		}
		for (int i = 0; i < array.length / 2; i++) {
			if (!array[i].equals(array[array.length - 1 - i])) {
				flag= false;	
			}		
		}
		return flag;
		

	}

	public void showDui() {
		if (dui()) {
			System.out.println("是回文字符串");
		} else
			System.out.println("不是回文字符串");
	}
}

主方法调用：

package com.lanou.test;

public class Main {
	public static void main(String[] args) {
		DuiCheng e = new DuiCheng("wangwei,haha,ww,ww,haha,wangwei");
		e.showDui();
		DuiCheng d = new DuiCheng("123456我654321");
		d.showDui();	
	}
}

字典序 排序：
类：

package com.lanou.test;

public class PaiXu {
	int a;

	public PaiXu(int a) {
		this.a = a;
	}

	public void pai() {
		String[] array = new String[a];
		for (int i = 0; i < array.length; i++) {
			array[i] = (i + 1) + "";
		}

		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array.length - i - 1; j++) {
				if (array[j].compareTo(array[j + 1]) > 0) {
					String temp = array[j];
					array[j] = array[j + 1];
					array[j + 1] = temp;
				}
			}
		}
		for (int i = 0; i < array.length; i++) {
			if (i != 0 && i % 10 == 0) {
				System.out.println();
			}
			System.out.print(array[i] + "\t");
		}
	}
}

调用：

PaiXu p =new PaiXu(100);
p.pai();