如何在java或php中查找概率的代码[关闭]

Question

I want to make a program like the example below.

input : 2
output : 
(1) , (2);
(1,2), (2,2);

input : 3 
output :
(1),(2),(3);
(1,2),(1,3),(2,3);
(1,2,3)

The formula is 2^^n-1.

I have tried only using for only. I want to get the all possibility.

like :
(1),(2);
(1,1),(1,2),(2,1),(2,1),

Answer 1

Use custom function on PHP:

$inputValues = range(1,3); //here you set your input(2 or 3 or what you want)

$result = array();

function variations($inputValues, $level, &$result, $current = array()) {
    for($i = 0; $i < count($inputValues); $i++) {
        $new = array_merge($current, array($inputValues[$i]));
        if($level == 1) {
          sort($new);
            if (!in_array($new, $result)) {
                $result[] = $new;          
            }
        } else {
            variations($inputValues, $level - 1, $result, $new);
        }
    }
}
for ($i = 0; $i<count($inputValues); $i++) {
    variations($inputValues, $i+1, $result);
    }

foreach ($result as $arr) {
    echo '('.join(",", $arr) . ')';
}

Result is:

(1)(2)(3)(1,1)(1,2)(1,3)(2,2)(2,3)(3,3)(1,1,1)(1,1,2)(1,1,3)(1,2,2)(1,2,3)(1,3,3)(2,2,2)(2,2,3)(2,3,3)(3,3,3)