6个答案 按时间排序 按投票排序

0 0

public static void main(String[] args) {
		String[] arr = {"apple Orange", "ORANGE apple",   
        "APPLeoRange", "APPLe oRange grape", "HI There", "THERE hI"};
		
		Map<String, String> cache = new HashMap<String, String>();
		for (String s : arr) {
			char[] ca = s.replaceAll("\\s+", "").toLowerCase().toCharArray();
			Arrays.sort(ca);
			cache.put(new String(ca), s);
		}
		System.out.println(cache.values());
	}

2013年7月10日 16:02

yaolifei
304
0 0 8

• 3条评论

0 0

class Sort {
	private static final String[] strings = {"apple Orange", "ORANGE apple", 
		"APPLeoRange", "APPLe oRange grape", "HI There", "THERE hI"};
	
	public static void main(String...args) {
		final Map<String, String> dict = new LinkedHashMap<String, String>();
		for (String s : strings) {
			dict.put(toKey(toTreeSet(s)), s);
		}
		
		for (String s : dict.values()) {
			System.out.println(s);
		}
	}
	
	private static TreeSet<String> toTreeSet(final String s) {
		final TreeSet<String> set = new TreeSet<String>();
		final StringTokenizer st = new StringTokenizer(s, " ");
		while (st.hasMoreTokens()) {
			set.add(st.nextToken().toLowerCase());
		}
		return set;
	}
	
	private static String toKey(TreeSet<String> set) {
		StringBuilder sb = new StringBuilder(128);
		for (String s : set) {
			sb.append(s);
		}
		return sb.toString();
	}
}

2013年7月01日 10:42

mike.liu
30
0 0 1

• 3条评论

0 0

如果字符串是这样："a B", "A b", "A b c", "B a", "E F", "F e"

那结果是
"A b c", "B a",  "F e"
还是
"B a",  "F e"

2013年6月30日 16:29

康敏栋
1
0 1 12

• 1条评论

0 0

手里没有IDE，用js实现了个，可参考

http://jsfiddle.net/houfeng0923/Puqma/3/

2013年6月30日 10:28

houfeng0923
577
0 0 0

• 添加评论

0 0

package com.cherish.shopping.util;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.StringTokenizer;

public class StringUtil {
	/**
	 * 处理字符串数组，将字符串数组转化成list调用dealString(String[] args)处理
	 * @param args
	 * @return 处理后的字符串数组
	 */
	public String[] dealString(String[] args) {
		//List<String> list = Arrays.asList(args);
		List<String> list = new ArrayList<String>();
		for (String s: args) {
			list.add(s);
		}
		dealList(list);
		return list.toArray(new String[list.size()]);

	}
	
	/**
	 * 处理list
	 * @param list
	 * @return 去掉相同只保留最后一个单词的list集合
	 */
	public void dealList(List<String> list) {
		List<String> listTemp = new ArrayList<String>();
		for (int i=0; i<list.size()-1; i++) {
			for (int j=i+1; j<list.size(); j++) {
				if (compareWords(list.get(i), list.get(j))) {
					listTemp.add(list.get(i));
				}
			}
		}
		for (String s: listTemp) {
			list.remove(s);
		}
	}

	/**
	 * 比较两个字符串是否相同（规则1）
	 * @param str1
	 * @param str2
	 * @return true(str1 == str2)
	 */
	public boolean compareWords(String str1, String str2) {
		List<String> listStr1 = getWords(str1);
		List<String> listStr2 = getWords(str2);
		if (listStr1.size() == listStr2.size()) {
			listStr1 = toLowerCase(listStr1);//全部转化成小写
			listStr2 = toLowerCase(listStr2);
			Collections.sort(listStr1);//将两个list排序，就不用考虑顺序的问题了，直接依次比较对应位置的单词是否相同
			Collections.sort(listStr2);
			int num = 0;//相同单词的个数
			for (int i=0; i<listStr1.size(); i++) {
				if (listStr1.get(i).equals(listStr2.get(i))) {
					num ++;
				}
			}
			return num == listStr1.size();
		}
		return false;
	}
	
	/**
	 * 获取字符串里面的所有单词
	 * @param str
	 * @return 装有字符串所有单词的list
	 */
	public List<String> getWords(String str) {
		List<String> list = new ArrayList<String>();
		StringTokenizer tokenizer = new StringTokenizer(str);
		while (tokenizer.hasMoreTokens()) {
			list.add(tokenizer.nextToken());
		}
		return list;
	}
	
	/**
	 * 将list里面每个单词都转化成小写
	 * @param list
	 * @return list(里面的字符串都是小写)
	 */
	public List<String> toLowerCase(List<String> list) {
		List<String> newList = new ArrayList<String>();
		for (String s: list) {
			newList.add(s.toLowerCase());
		}
		return newList;
	}
	
	public static void main(String[] args) {
		String[] arrays = {"apple Orange", "ORANGE apple", "APPLe oRange", "APPLE oRange grape", "HI There", "THERE hI"};
		String[] result = new StringUtil().dealString(arrays);//处理后的结果
		System.out.println("处理前：");
		for (String s: arrays) {
			System.out.print("\"" + s + "\"" + ", ");
		}
		System.out.println();
		System.out.println("处理后：");
		for (String s: result) {
			System.out.print("\"" + s + "\"" + ", ");
		}
	}
}

2013年6月29日 23:21

cherishmmo2004
2
0 0 9

• 4条评论

0 0

package com.chinahrt.zyn.iteye;

import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Set;

public class StringColculate {
	
	
	public void compare(String[] s){
		List<String> strList = new ArrayList<String>();
		for(int i=0;i<s.length;i++){
			String s1 = s[i];
			int index = isHave(strList,s1);
			if(index==-1){
				strList.add(s1);
			}else{
				strList.remove(index);
				strList.add(index,s1);
			}
		}
		System.out.println(strList.toString());
	}
	
	//list中是否含有s，有的话返回序号
	public int isHave(List<String> list,String s){
		int index = -1;
		boolean flag = false;
		for(int i=0;i<list.size();i++){
			String str=list.get(i);
			if(isEqual(str,s)){
				index=i;
				break;
			}
			
		}
		return index;
	}
	
	/**
	 * 判断s1和s2是否相等
	 * @param s1
	 * @param s2
	 * @return
	 */
	public boolean isEqual(String s1,String s2){
		if((s1.length())==s2.length()){
			String[] s11 = s1.split(" ");
			String[] s22 = s2.split(" ");
			Set<String> set = new HashSet<String> ();
			for(String str:s11){
				set.add(str.toLowerCase());
			}
			int m = set.size();
			for(String str:s22){
				set.add(str.toLowerCase());
			}
			int n = set.size();
			if(m==n){
				return true;
			}else{
				return false;
			}
		}else{
			return false;
		}
	}

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		String[] s = {"apple Orange","ORANGE apple","APPLe oRange","APPle oRange grape","HI There","THERE hI"};
		StringColculate sc = new StringColculate();
		sc.compare(s);
	}

}

2013年6月29日 22:50

zyn010101
2795
2 3 156

• 添加评论