效率巅峰：Go&Java算法携手字母大小写全排列完美演示！

2024-01-31 12:42:30

字母大小写全排列简介

字母大小写全排列是一种算法，它可以生成一个字符串的所有可能的大小写排列。例如，字符串“abc”的所有可能的大小写排列包括“abc”、“Abc”、“aBc”、“ABc”、“aBC”和“ABC”。

Go语言算法实现

package main

import (
	"fmt"
	"strings"
)

func main() {
	str := "abc"
	permutations := permute(str)

	fmt.Println("All possible permutations of", str, "are:")
	for _, permutation := range permutations {
		fmt.Println(permutation)
	}
}

func permute(str string) []string {
	if len(str) == 1 {
		return []string{str}
	}

	var permutations []string
	for i, char := range str {
		rest := str[:i] + str[i+1:]
		subPermutations := permute(rest)
		for _, subPermutation := range subPermutations {
			permutations = append(permutations, string(char)+subPermutation)
		}
	}

	return permutations
}

Java语言算法实现

import java.util.ArrayList;
import java.util.List;

public class Permutations {

    public static void main(String[] args) {
        String str = "abc";
        List<String> permutations = permute(str);

        System.out.println("All possible permutations of " + str + " are:");
        for (String permutation : permutations) {
            System.out.println(permutation);
        }
    }

    public static List<String> permute(String str) {
        List<String> permutations = new ArrayList<>();
        if (str.length() == 1) {
            permutations.add(str);
            return permutations;
        }

        for (int i = 0; i < str.length(); i++) {
            char charAtI = str.charAt(i);
            String rest = str.substring(0, i) + str.substring(i + 1);
            List<String> subPermutations = permute(rest);
            for (String subPermutation : subPermutations) {
                permutations.add(charAtI + subPermutation);
            }
        }

        return permutations;
    }
}