首页
学习
活动
专区
圈层
工具
发布
社区首页 >问答首页 >在Java中寻找笛卡尔乘积

在Java中寻找笛卡尔乘积
EN

Stack Overflow用户
提问于 2011-07-03 22:51:59
回答 2查看 3.9K关注 0票数 5

我想找一组元素的笛卡尔乘积。下面是一个例子

示例1:

代码语言:javascript
复制
sets : (ab) (bc) (ca)

笛卡尔乘积是:

代码语言:javascript
复制
abc aba acc aca bbc bba bcc bca

示例2:

代码语言:javascript
复制
sets : (zyx) b c

笛卡尔乘积是:

代码语言:javascript
复制
zbc ybc xbc

因此,我正在考虑一种在Java中执行的算法,它可以找到在编译时定义的特定数量组的笛卡尔乘积。

EN

回答 2

Stack Overflow用户

回答已采纳

发布于 2011-07-03 22:57:00

您可以使用Google's Guava libraries中的Sets.cartesianProduct()方法生成笛卡尔积:

代码语言:javascript
复制
com.google.common.collect.Sets.cartesianProduct(Set[] yourSets)

如果一切都那么简单就好了!

票数 8
EN

Stack Overflow用户

发布于 2012-04-10 13:38:07

定义您自己的迭代器/迭代器:

代码语言:javascript
复制
import java.util.*;

class CartesianIterator <T> implements Iterator <List <T>> {

    private final List <List <T>> lilio;    
    private int current = 0;
    private final long last;

    public CartesianIterator (final List <List <T>> llo) {
        lilio = llo;
        long product = 1L;
        for (List <T> lio: lilio)
            product *= lio.size ();
        last = product;
    } 

    public boolean hasNext () {
        return current != last;
    }

    public List <T> next () {
        ++current;
        return get (current - 1, lilio);
    }

    public void remove () {
        ++current;
    }

    private List<T> get (final int n, final List <List <T>> lili) {
        switch (lili.size ())
        {
            case 0: return new ArrayList <T> (); // no break past return;
            default: {
                List <T> inner = lili.get (0);
                List <T> lo = new ArrayList <T> ();
                lo.add (inner.get (n % inner.size ()));
                lo.addAll (get (n / inner.size (), lili.subList (1, lili.size ())));
                return lo;
            }
        }
    }
}

class CartesianIterable <T> implements Iterable <List <T>> {

    private List <List <T>> lilio;  

    public CartesianIterable (List <List <T>> llo) {
        lilio = llo;
    }

    public Iterator <List <T>> iterator () {
        return new CartesianIterator <T> (lilio);
    }
}

并使用您的数据进行测试:

代码语言:javascript
复制
class CartesianIteratorTest {

    public static void main (String[] args) {
        List <Character> la = Arrays.asList (new Character [] {'a', 'b'});
        List <Character> lb = Arrays.asList (new Character [] {'b', 'c'});      
        List <Character> lc = Arrays.asList (new Character [] {'c', 'a'});
        List <List <Character>> llc = new ArrayList <List <Character>> ();
        llc.add (la);
        llc.add (lb);
        llc.add (lc);

        CartesianIterable <Character> ci = new CartesianIterable <Character> (llc);
        for (List<Character> lo: ci)
            show (lo);

        la = Arrays.asList (new Character [] {'x', 'y', 'z'});
        lb = Arrays.asList (new Character [] {'b'});    
        lc = Arrays.asList (new Character [] {'c'});
        llc = new ArrayList <List <Character>> ();
        llc.add (la);
        llc.add (lb);
        llc.add (lc);

        ci = new CartesianIterable <Character> (llc);
        for (List<Character> lo: ci)
            show (lo);    
    }

    public static void show (List <Character> lo) {
        System.out.print ("(");
        for (Object o: lo)
            System.out.print (o);
        System.out.println (")");
    }
}

结果:

代码语言:javascript
复制
(abc)
(bbc)
(acc)
(bcc)
(aba)
(bba)
(aca)
(bca)
(xbc)
(ybc)
(zbc)
票数 2
EN
页面原文内容由Stack Overflow提供。腾讯云小微IT领域专用引擎提供翻译支持
原文链接:

https://stackoverflow.com/questions/6563589

复制
相关文章

相似问题

领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档