为什么STL的排序功能不起作用? [英] why sort function of STL is not working?

问题描述

一组数字将作为输入传递.同样，以升序排列的数字0-9的重新定义关系也将作为输入传递.根据重新定义的关系，数字集必须以升序列出.样本I/O

A set of numbers will be passed as input. Also the redefined relationship of the digits 0-9 in ascending order will be passed as input. Based on the redefined relationship, the set of numbers must be listed in ascending order. Sample I/O

输入:

20 50 11 121

9231476058

输出:

50 11 20 121

我写的程序有一个我不知道的错误.因此，请帮助我进行调试.

The program which i wrote having an error about which i am not aware of. so, please help me in debugging it.

程序说明:

1.)我创建了一个邻接列表，用于根据数字的位数进行分组(50 11 20分组在索引2，121分组在索引3)

1.) I created one adjacency list for grouping the numbers on the basis of their number of digits(50 11 20 grouped at index 2 and 121 at index 3)

2.)为了对它们进行排序，我使用了标准模板库的排序功能.我已经传递了以下参数

2.)For sorting them i have used standard template library sort function. I have passed the following parameters

list<int> *lst=new list<int>[10];       //adjacency list

void sortg(list<int> *lst,int *arr1)
{
    static int *arr=arr1;
    struct fnct
    {
        int digi;

        fnct(int digi)
        {
            this->digi=digi;
        }
        bool operator()(int val1,int val2)
        {
            while(digi>0)  // is the number of digits of the passed arguments
            {
                //logic for sorting. here i have used local arry "*arr" which i
                //have declared static
            }
        }
    };

    for(int con=9;con>=0;--con)      //count for the rows of adjacency list
    {
        if( (*(lst+con)).size()>0 )     // for finding out a valid list
        {
            sort((lst+con)->begin(),(lst+con)->end(),fnct(con));

        }
    }
}

我得到的错误是:

In file included from /usr/include/c++/4.9/algorithm:62:0,from prog.cpp:5:
/usr/include/c++/4.9/bits/stl_algo.h: In instantiation of 'void
std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with
_RandomAccessIterator = std::_List_iterator<int>; _Compare =                  
__gnu_cxx::__ops::_Iter_comp_iter<sortg(std::list<int>*, int*)::fnct>]':
/usr/include/c++/4.9/bits/stl_algo.h:4716:78:   required from 'void              

std::sort(_RAIter, _RAIter, _Compare) [with _RAIter =   

std::_List_iterator<int>;    _Compare = sortg(std::list<int>*, int*)::fnct]'
prog.cpp:124:63:   required from here
/usr/include/c++/4.9/bits/stl_algo.h:1968:22: error: no match for       'operator-  

'    (operand types are 'std::_List_iterator<int>' and   

'std::_List_iterator<int>')
 std::__lg(__last - __first)     

*2,/usr/include/c++/4.9/bits/stl_algo.h:1968:22: note:      

'std::_List_iterator<int>' is not derived from 'const    

std::move_iterator<_Iterator>'
 std::__lg(__last - __first) * 2,


                 "Lines are removed from here"
                  ^
In file included from /usr/include/c++/4.9/vector:65:0,
             from /usr/include/c++/4.9/bits/random.h:34,
             from /usr/include/c++/4.9/random:49,
             from /usr/include/c++/4.9/bits/stl_algo.h:66,
             from /usr/include/c++/4.9/algorithm:62,
             from prog.cpp:5:
/usr/include/c++/4.9/bits/stl_bvector.h:208:3: note: std::ptrdiff_t   std::operator-(const std::_Bit_iterator_base&, const std::_Bit_iterator_base&)
operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
^
/usr/include/c++/4.9/bits/stl_bvector.h:208:3: 

note:no known conversion for argument 1 from 'std::_List_iterator<int>' to   
'const std::_Bit_iterator_base&'

由于此错误很长，因此我删除了其中的一些行

Since this error is lengthy i have removed some lines from in between of it

推荐答案

第

 sort((lst+con)->begin(),(lst+con)->end(),fnct(con));

说

 In instantiation of 'void
std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with
_RandomAccessIterator = std::_List_iterator<int>; _Compare =                  
__gnu_cxx::__ops::_Iter_comp_iter<sortg(std::list<int>*, int*)::fnct>]'

现在，列表已构建为双链表(因此双向迭代)，其主要功能是支持恒定时间的插入和擦除操作.但是随机访问?否

Now, List is built as a doubly linked list (hence iteration in both directions) with its primary feature being the support for constant time insert and erase operations. But Random Access ? No.

因此，错误消息说排序需要的不是List Iterator所需的RandomAccessIterator(它是双向的Iterator，预期将list实现为双向链接列表).

So, the error message says that sort needs RandomAccessIterator which List Iterator isn't (It is Bidirectional iterator which is expected as list is implemented as a doubly linked list).

因此，使用成员函数sort可以做到这一点.

So, use the member function sort to do this.

(*(lst+con).)sort(fnct(con));  // Use it as appropriate

这篇关于为什么STL的排序功能不起作用?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！