OO先导课——作业(2)

list排序

http://blog.csdn.net/tjcyjd/article/details/6804690

http://blog.csdn.net/xiaxiaorui2003/article/details/24308785

‘改list内容

http://bbs.csdn.net/topics/390846767

’https://zhidao.baidu.com/question/91971366.html

retainAll方法求交集

https://zhidao.baidu.com/question/1770375429803673300.html

http://book.2cto.com/201309/31474.html

list和数组互转

http://jingyan.baidu.com/article/86f4a73e607f2937d7526972.html

之前关闭scanner  

http://bbs.csdn.net/topics/390788856

输入

bug 等号(子串头的范围)

public int countTime(String aim){
int ans=0;
String[] t=new String[aim.length()];
String tt=new String();
String ttt=new String();
for(int i=0;i<list.size();i++){
for(int j=0;j<=list.get(i).length()-aim.length();j++){
ttt=list.get(i).substring(j, j+aim.length());
if(ttt.compareTo(aim)==0) ans++;
}
}
System.out.println(aim+"出现次数"+ans);
return ans;

}

思路

空串

原文地址:https://www.cnblogs.com/iwanna/p/7148340.html