可以用数组进行6种组合的排序吗？

通过stream流式处理进行操作

package zh.codegym.task.task03.task0313;
import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;
import java.util.stream.Stream;

/*
我是山姆
*/

public class Solution {
    public static void main(String[] args) {
        //在此编写你的代码

        List<String> list = new ArrayList<>();
        list.add("山姆");
        list.add("我");
        list.add("是");
        List<String> result =  permutationNoRepeat(list,list.size());
        for(int i = 0 ; i < result.size();i ++){
            System.out.println(result.get(i));
        }

    }
    /**
     * 排列组合(字符不重复排列)
     * @param list 待排列组合字符集合(忽略重复字符)
     * @param length 排列组合生成长度(当前参与校验的字符个数 本题为3)
     * @return 指定长度的排列组合后的字符串集合
     * @author iamo
     */
    public static List<String> permutationNoRepeat(List<String> list, int length) {
        // 去重复
        Stream<String> stream = list.stream().distinct();
        for (int n = 1; n < length; n++) {
            stream = stream.flatMap(str -> list.stream()
                                       // 生产过程中会存在重复 过滤掉
                                       .filter(temp -> !str.contains(temp))
                                       .map(str::concat));
    }
     return stream.collect(Collectors.toList());
    }
}

You could do it with nested loops if it is just the three words... or you go for recursion approach 1: (works just with three array elements)

Set<String> res = new HashSet<>();
String[] array = {"Sam", "I", "Am"};

for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
        if (i == j) continue;
        for (int k = 0; k < 3; k++) {
            if (k == i || k == j) continue;
            res.add(array[i] + array[j] + array[k]);
        }
    }
}
res.forEach(System.out::println);