
假设我们有一个二进制数,它表示一个数字n。我们需要找到一个二进制数,它比n大但是最小,并且它也有相同数量的0和1。所以如果这个数是1011(十进制为11),那么输出将是1101(十进制为13)。可以使用下一个排列计算来解决这个问题。让我们看看获取这个想法的算法。
算法
nextBin(bin) −
Begin
len := length of the bin
for i in range len-2, down to 1, do
if bin[i] is 0 and bin[i+1] = 1, then
exchange the bin[i] and bin[i+1]
break
end if
done
if i = 0, then there is no change, return
otherwise j:= i + 2, k := len – 1
while j < k, do
if bin[j] is 1 and bin[k] is 0, then
exchange bin[j] and bin[k]
increase j and k by 1
else if bin[i] is 0, then
break
else
increase j by 1
end if
done
return bin
EndExample
的中文翻译为:示例
#includeusing namespace std; string nextBinary(string bin) { int len = bin.size(); int i; for (int i=len-2; i>=1; i--) { if (bin[i] == '0' && bin[i+1] == '1') { char ch = bin[i]; bin[i] = bin[i+1]; bin[i+1] = ch; break; } } if (i == 0) "No greater number is present"; int j = i+2, k = len-1; while (j < k) { if (bin[j] == '1' && bin[k] == '0') { char ch = bin[j]; bin[j] = bin[k]; bin[k] = ch; j++; k--; } else if (bin[i] == '0') break; else j++; } return bin; } int main() { string bin = "1011"; cout << "Binary value of next greater number = " << nextBinary(bin); }
输出
Binary value of next greater number = 1101










