后续子集算法

2019独角兽企业重金招聘Python工程师标准>>>

<?php
header('Content-Type: text/html; charset=utf-8');
/**
 * 后续子集算法
 */

$str = '001';

$n = strlen($str)-1;
$k = $n;

while ($k>=0 && $str{$k}==1)
{
	$k--;
}
if ($k>=0) 
{
	$str{$k} = 1;
	for ($i = $k+1; $i <= $n; $i++) 
	{
		$str{$i} = 0;	
	}
	$str_next = $str;
}
else
{
	$str_next = '本串全是1';
}
echo $str_next;

转载于:https://my.oschina.net/liuhui1990/blog/37968