package com.oj.Q22; import java.util.ArrayList; //import java.util.Collection; import java.util.Collections; import java.util.Scanner; //import java.util.TreeSet; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); String a,b; while(sc.hasNext()) { a = sc.nextLine(); b = sc.nextLine(); char[] ac = a.toCharArray(); char[] bc = b.toCharArray(); //TreeSet<Character> set = new TreeSet<>(); ArrayList<Character> list = new ArrayList<>(); for(int i = 0; i < ac.length; i ++) { for(int j = 0 ; j < bc.length; j ++) { if(ac[i] == bc[j]) { //set.add(ac[i]); list.add(ac[i]); bc[j] = '0'; break; } } } Collections.sort(list); //for (Character character : set) { /*for (Character character : list) { System.out.print(character); }*/ for(int i = 0; i < list.size(); i ++) { System.out.print(list.get(i)); } System.out.println(); } } } |
Double click to view unformatted code.