【问题描述】输入一个字符串,从头到尾搜索,凡搜索到前面已出现过的相同单词,就删除。也就是说,在这个字符串中,每个单词只能出现一次。【样例】输入:Where there is a will , there is a way输出:Where there is a will , wayimport java.util.ArrayList;//where there is a ,ther is a willpublic class Title5 { public static void main(String[] args){ f(); } //主要算法 public static void f(){ String message="where there is a , there is a will !"; String[] arrStr = message.split(" "); //新的容器 ArrayList<String> list = new ArrayList<String>(); for(int i=0;i<arrStr.length;i++){ String temp = arrStr[i]; if(list.contains(temp)){ continue; }else{ list.add(temp); } } for(int i=0;i<list.size();i++){ System.out.print(list.get(i)+" "); } }}