字符串去重算法（java）

package com.kiki.demo;
import java.util.Arrays;
/**
 * @author kiki
 * @version 1.0
 * @create 2020/7/8 19:52
 */
public class DeduplicationChar {
    public static void main(String[] args) {
        char[] charArr = {'a','b','c','a','d','e','b'};
        char[] tmp = new char[charArr.length];
        System.out.println(Arrays.toString(tmp));
        System.out.println(Arrays.toString(charArr));
        clear(charArr,tmp);
        System.out.println(Arrays.toString(tmp));
    }

    public static char[] clear(char[] charArr,char[] tmp){

       boolean flag;
       int m =0;
        for (int i=0;i<charArr.length;i++){
            flag = true;
            for (int j=0;j<m;j++){
                if (tmp[j]==charArr[i]){
                    flag = false;
                }
            }
            if (flag){
                tmp[m++] = charArr[i];
            }
        }
        return tmp;
    }
}

[ , , , , , , ]
[a, b, c, a, d, e, b]
[a, b, c, d, e, , ]
https://blog.csdn.net/cyb519/article/details/82114047