UVA 156 如何无序的匹配单词

最新推荐文章于 2018-07-19 15:23:43 发布

森林海的棕熊

最新推荐文章于 2018-07-19 15:23:43 发布

阅读量195

点赞数

分类专栏：随笔文章标签： uva

本文链接：https://blog.csdn.net/qq951127336/article/details/78291571

版权

随笔专栏收录该内容

40 篇文章 0 订阅

订阅专栏

UVA 156 Ananagrams

import java.util.*;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

/**
 * Created by 95112 on 10/20/2017.
 */
public class Ananagrams {
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        ArrayList<String> storage = new ArrayList<>();
        HashMap<String,Integer> map = new HashMap<>();
        ArrayList<String>  answers = new ArrayList<>();
        String paStr = "([a-zA-Z]+)";
        Pattern pattern = Pattern.compile(paStr);
        Matcher matcher;
        do {
            String input = scanner.nextLine();
            if (input.equals("#"))
                break;
            matcher = pattern.matcher(input);
            while (matcher.find())
            {
                if (!storage.contains(matcher.group(1))) {

                    storage.add(matcher.group(1));
                    String tmpStr = matcher.group(1).toLowerCase();
                    char[] tmp = tmpStr.toCharArray();
                    Arrays.sort(tmp);
                    tmpStr = String.valueOf(tmp);
                    if (!map.containsKey(tmpStr)) {
                        map.put(tmpStr,1);
                    }
                    else
                    {
                        map.put(tmpStr,map.get(tmpStr)+1);
                    }
                }
            }
        }while(true);
        for (String test : storage)
        {
            char[] tmp = test.toLowerCase().toCharArray();
            Arrays.sort(tmp);
            String tmpStr = String.valueOf(tmp);
            if (map.get(tmpStr) == 1)
                answers.add(test);
        }
        Collections.sort(answers);
        for (String ans : answers)
            System.out.println(ans);
    }
}