矢量指向另一个矢量
我在这里有两个不同类型的数组，我正在转换为向量。
int ham_array[] = {32,71,12,45,26};
char word_array[] = {"cat", "bat", "green", "red", "taxi"};
vector < int > hamvector (ham_array, ham_array + 5);
vector < char > wordvector(word_array, word_array + 5);
ham_array[] = {12, 26, 32, 45, 71}
word_array[] = {"green", "taxi", "cat", "red", "bat"};
没有找到相关结果
已邀请:
3 个回复
哭木算
，你宣称它将是一个字符串的方式。 无论如何，这样做的方法是声明一个结构来保持这些东西配对：struct t {string name; int number;}; vector<t> list; // fill in list // comparer to compare two such structs bool comparer(t &a, t &b) { return a.number>=b.number; } // and to sort the list sort(list.begin(), list.end(), comparer);靛新比比催
也支持对原始数组进行排序：正如Blindy所示，你需要一个比较器函数来告诉你如何对你的单词列表进行排序。否则，您最终将按字符串所在的内存地址而不是字符串中的字母进行排序。这样的事情应该有效：int wordcmp(const char *lhs, const char *rhs) { return strncmp(lhs, rhs, 256) < 0; }而不是原始指针数组，因为后者不那么安全。遣莫捅炭
进行自己的手动排序。#include <map> #include <string> #include <vector> #include <algorithm> #include <iostream> template<typename KeyType, typename ValueType> class CMappedSorter { std::map<KeyType, ValueType>* const m_Mappings; public: CMappedSorter(std::map<KeyType, ValueType>* Mappings) : m_Mappings(Mappings) { } bool operator()(KeyType& LHS, KeyType& RHS) { const ValueType LHSSortingValue = m_Mappings->find(LHS)->second; const ValueType RHSSortingValue = m_Mappings->find(RHS)->second; return (LHSSortingValue < RHSSortingValue); } }; int main(int argc, char* argv[]) { std::vector<int> Integers; std::vector<std::string> Strings; Integers.push_back(3); Integers.push_back(1); Integers.push_back(2); Strings.push_back("Apple"); Strings.push_back("Banana"); Strings.push_back("Cherry"); std::map<std::string, int> Mappings; if(Integers.size() == Strings.size()) { const unsigned int ElementCount = Strings.size(); // Generate mappings. auto StringsIterator = Strings.begin(); auto IntegersIterator = Integers.begin(); for(unsigned int i = 0; i < ElementCount; ++i) { Mappings[*(StringsIterator)] = *(IntegersIterator); ++StringsIterator; ++IntegersIterator; } // Print out before sorting. std::cout << "Before Sorting" << std::endl; std::cout << "InttString" << std::endl; StringsIterator = Strings.begin(); IntegersIterator = Integers.begin(); for(unsigned int i = 0; i < ElementCount; ++i) { std::cout << *(IntegersIterator) << 't' << *(StringsIterator) << std::endl; ++StringsIterator; ++IntegersIterator; } // Sort std::sort(Strings.begin(), Strings.end(), CMappedSorter<std::string, int>(&(Mappings))); std::sort(Integers.begin(), Integers.end()); // Print out after sorting. std::cout << "After Sorting" << std::endl; std::cout << "InttString" << std::endl; StringsIterator = Strings.begin(); IntegersIterator = Integers.begin(); for(unsigned int i = 0; i < ElementCount; ++i) { std::cout << *(IntegersIterator) << 't' << *(StringsIterator) << std::endl; ++StringsIterator; ++IntegersIterator; } } else { std::cout << "Error: Number of elements in each container are not equivalent." << std::endl; } }