
java查询一个字符串中重复的字符
展开全部
1:
public static List<Character> test(String str) {
Set<Character> set = new HashSet<Character>();
List<Character> list = new ArrayList<Character>();
for(int i=0;i<str.length();i++){
char c = str.charAt(i);
boolean has = set.contains(c);
if(has){
list.add(c);
}
else{
set.add(c);
}
}
return list;
}
只写了一个方法,供参考。
2:
import java.util.ArrayList;
public class Test {
public static void main(String[] args) {
String s = "abcdaebijkd";
ArrayList list = new ArrayList();
for(int i=0; i<s.length(); i++){
char c = s.charAt(i);
if(s.indexOf(c,i+1)>-1){
Character ch = new Character(c);
if(!list.contains(ch))
list.add(ch);
}
}
for(int i=0; i<list.size(); i++)
System.out.print(list.get(i)+",");
}
}
.
.
.
.
.
.
.
public static List<Character> test(String str) {
Set<Character> set = new HashSet<Character>();
List<Character> list = new ArrayList<Character>();
for(int i=0;i<str.length();i++){
char c = str.charAt(i);
boolean has = set.contains(c);
if(has){
list.add(c);
}
else{
set.add(c);
}
}
return list;
}
只写了一个方法,供参考。
2:
import java.util.ArrayList;
public class Test {
public static void main(String[] args) {
String s = "abcdaebijkd";
ArrayList list = new ArrayList();
for(int i=0; i<s.length(); i++){
char c = s.charAt(i);
if(s.indexOf(c,i+1)>-1){
Character ch = new Character(c);
if(!list.contains(ch))
list.add(ch);
}
}
for(int i=0; i<list.size(); i++)
System.out.print(list.get(i)+",");
}
}
.
.
.
.
.
.
.
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
试试这个
import java.util.ArrayList;
public class Test {
public static void main(String[] args) {
String s = "abcdaebijkd";
ArrayList list = new ArrayList();
for(int i=0; i<s.length(); i++){
char c = s.charAt(i);
if(s.indexOf(c,i+1)>-1){
Character ch = new Character(c);
if(!list.contains(ch))
list.add(ch);
}
}
for(int i=0; i<list.size(); i++)
System.out.print(list.get(i)+",");
}
}
import java.util.ArrayList;
public class Test {
public static void main(String[] args) {
String s = "abcdaebijkd";
ArrayList list = new ArrayList();
for(int i=0; i<s.length(); i++){
char c = s.charAt(i);
if(s.indexOf(c,i+1)>-1){
Character ch = new Character(c);
if(!list.contains(ch))
list.add(ch);
}
}
for(int i=0; i<list.size(); i++)
System.out.print(list.get(i)+",");
}
}
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
public class StringDemo {
public static void main(String[] args) {
String str = "abcmnabcjnabcisabckdabcfdabc";
System.out.println(str.indexOf("abc"));// 0
StringDemo stringDemo = new StringDemo();
int rescult=stringDemo.searchRepeat(str, "abc");
System.out.println(rescult);
}
public int searchRepeat(String string, String wantWords) {
int repeateTime = 0;
int startSearchPlace = 0;
while ((startSearchPlace = string.indexOf(wantWords, startSearchPlace)) != -1) {
repeateTime++;
startSearchPlace += wantWords.length();
}
return repeateTime;
}
}
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
import java.util.ArrayList;
public class Test {
public static void main(String[] args) {
String s = "abcdaebijkd";
ArrayList list = new ArrayList();
for(int i=0; i<s.length(); i++){
char c = s.charAt(i);
if(s.indexOf(c,i+1)>-1){
Character ch = new Character(c);
if(!list.contains(ch))
list.add(ch);
}
}
for(int i=0; i<list.size(); i++)
System.out.print(list.get(i)+",");
}
}
public class Test {
public static void main(String[] args) {
String s = "abcdaebijkd";
ArrayList list = new ArrayList();
for(int i=0; i<s.length(); i++){
char c = s.charAt(i);
if(s.indexOf(c,i+1)>-1){
Character ch = new Character(c);
if(!list.contains(ch))
list.add(ch);
}
}
for(int i=0; i<list.size(); i++)
System.out.print(list.get(i)+",");
}
}
本回答被提问者采纳
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
展开全部
public static void main(String[] args) throws Exception {
String a = "abcdaebijkd";
String strRes = "";
for(int i=0;i<a.length();i++){
if(a.lastIndexOf(a.toCharArray()[i]) != i){
strRes = strRes + a.toCharArray()[i];
}
}
System.out.println(strRes);
}
String a = "abcdaebijkd";
String strRes = "";
for(int i=0;i<a.length();i++){
if(a.lastIndexOf(a.toCharArray()[i]) != i){
strRes = strRes + a.toCharArray()[i];
}
}
System.out.println(strRes);
}
已赞过
已踩过<
评论
收起
你对这个回答的评价是?
推荐律师服务:
若未解决您的问题,请您详细描述您的问题,通过百度律临进行免费专业咨询