sort for List._list跳着比-优快云博客

本文链接：https://blog.youkuaiyun.com/wunderup/article/details/5916304

本文展示了一个使用C++进行字符串列表排序的例子，通过自定义比较函数和结构体实现了不同排序逻辑，包括按字符串长度从大到小及从小到大的排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <iostream> #include <vector> #include <list> #include <algorithm> using namespace std; bool myfunction(std::string one, std::string two) { if(one.length() > two.length()) { return true; } else { return false; } } bool myfunction1(std::string first, std::string second) { if(first.length() < second.length()) { return true; } else { return false; } } struct myclass { bool operator()(std::string first,std::string second) { if(first.length() < second.length()) { return true; } else { return false; } } }myobject; //print void print(list<std::string>& li) { std::list<std::string>::iterator it; std::cout << "/nlist's length: " << li.size() << " list's content is " << endl; for(it = li.begin(); it != li.end(); it++) { std::cout << (*it).c_str() << " "; } std::cout << endl; } void sort_list() { list<std::string> li; li.push_back("hello"); li.push_back("tree"); li.push_back("world"); li.push_back("my"); li.push_back("I"); li.push_back("computer"); li.push_back("tree"); li.push_back("forest"); //print before sort print(li); //sort li.sort(myfunction); print(li); li.sort(myfunction1); print(li); li.sort(myobject); print(li); return; } int main() { sort_list(); }

执行输出：

ewuming/tmp>g++ -o b.out sort_list.cc
ewuming/tmp>./b.out

list's length: 8 list's content is
hello tree world my I computer tree forest

list's length: 8 list's content is
computer forest hello world tree tree my I

list's length: 8 list's content is
I my tree tree hello world forest computer

list's length: 8 list's content is
I my tree tree hello world forest computer