# 重复元素选择算法 selection 源代码

//
// This file is an algorithm of selection.  This library is free
// software; you can redistribute it and/or modify it under the
// Free Software Foundation; either version 2, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// You should have received a copy of the GNU General Public License along
// with this library; see the file COPYING.  If not, write to the Free
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
// USA.

#include <algorithm>
#include <iostream>
#include <cstdlib>
using namespace std;

template <typename BiIter>
bool
next_selection (BiIter first, BiIter last)
{
if (first == last)
return false;

BiIter i = last;
if (--i == first)
return false;

BiIter j = i;
if (*--i == 0)
{
while ((i != first) && (*i == 0))
--i;
if (*i == 0)
{
iter_swap (first, j);
return false;
}

BiIter ii = i;
*(++ii) = *j + 1;
*j = 0;
--*i;
}
else
{
--*i;
++*j;
}
return true;
}

template <typename BiIter>
bool
prev_selection (BiIter first, BiIter last)
{
if (first == last)
return false;

BiIter i = last;
--i;
if (first == i)
return false;

if (*i == 0)
{
while (*--i == 0)
;
if (i == first)
{
*--last = *i;
*i = 0;
return false;
}
BiIter j = i;
--j;
++*j;
--*i;
iter_swap (i, --last);
}
else
{
BiIter j = i;
--j;
++*j;
--*i;
}
return true;
}

// for test:
int main()
{
const int n = 4;
int a[n] = {0, 0, 0, 3};

do
{
for (int i = 0; i < n; ++i)
for (int j = 0; j < a[i]; ++j)
cout << (i + 1);
cout << endl;
}
while (prev_selection (a, a+n));

cout << "------------------" << endl;

int b[n] = {3, 0, 0, 0};
do
{
for (int i = 0; i < n; ++i)
for (int j = 0; j < b[i]; ++j)
cout << (i + 1);
cout << endl;
}
while (next_selection (b, b+n));

system ("pause");
}

• 本文已收录于以下专栏：

举报原因： 您举报文章：重复元素选择算法 selection 源代码 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)