Permutations of integers with sum restrictions
1 回表示 (過去 30 日間)
古いコメントを表示
Christoph Heilmann
2018 年 3 月 1 日
コメント済み: Christoph Heilmann
2018 年 3 月 15 日
Hi Matlab gurus,
I would like to find all possible permutations of [-1 0 1] for a varying with varying length with a restriction on the overall sum across on permutation.
npermutek([-1 0 1],n) already allows me to find all possible permutations with varying length n. Is there a way to add the additional sum restriction across all permutations (e.g., n = 3 but output should only include permutations with a sum of 2)?
Since the length goes up to n=40 I running npermutek([-1 0 1],n) would be unfeasible without additional restrictions.
Any help on this issues would be greatly appreciated.
Thanks, Christoph
0 件のコメント
採用された回答
Suraj Mankulangara
2018 年 3 月 13 日
Hi Christoph
There are a couple of ways that you can do this:
1. Edit the source code of the "npermutek" function. Where the permutation row is calculated, find the sum of that row. Only add those rows to the matrix that meet the sum restriction
2. Alternatively, you can do:
permutedMatrix = npermutek([2 4 5], 2); % Returns permutations of length 2
permutedMatrix(sum(permutedMatrix, 2) <= maxSum, :) % Returns only those permutations whose sum is less than or equal to maxSum
The second method will allow you to continue using npermutek without making any modifications, if that is of interest to you.
その他の回答 (0 件)
参考
カテゴリ
Help Center および File Exchange で Multidimensional Arrays についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!