找到第一个不重复的字符(Bd interview)

最新推荐文章于 2023-02-25 22:41:55 发布

harkecho

最新推荐文章于 2023-02-25 22:41:55 发布

阅读量112

点赞数

分类专栏：面试[

本文链接：https://blog.csdn.net/u012581760/article/details/106365067

版权

面试[ 专栏收录该内容

49 篇文章 1 订阅

订阅专栏

方法一

  public static void searchRepeat(char[] character) {

        List<Character> list = new ArrayList<>();
        for (int i = 0; i < character.length - 1; i++) {
            int count = 0;
            for (int j = i + 1; j < character.length; j++) {
               if (character[i] == character[j]){
                   count++;
               }
            }
            if (count == 0){
                System.out.println(character[i]);
                break;
            }
        }
    }
  public static void main(String[] args) {
        searchRepeat("abcaef".toCharArray());

    }

方法二

  public static void searchRepeatChar(char[] character) {
        List<Character> list = new ArrayList<>();
        for(int i = 0; i < character.length - 1; i++){
            Boolean isTrue = false;
            if (list.contains(character[i]) ){
                continue;
            }else{

                for(int j = i + 1; j < character.length; j++){
                    if(character[i] == character[j]) {
                        list.add(character[i]);
                        isTrue = true;
                    }
                }

                if(isTrue == false) {
                    System.out.println(character[i]);
                    break;
                }

            }

        }
    }