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

// Copyright (C) 2004 BenBear
//
// This file is an algorithm of selection.  This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by 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");
}

 

阅读更多
个人分类: 算法
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭