There is no std::vector<…>::sort. Instead, you will need to use std::sort: std::sort(orderedList.begin(), orderedList.end()); However, this will try to compare the pointers in your std::vector<Shape*> (hint: refactor this if at all possible). Instead, you will need to pass a custom comparator that dereferences the pointers: std::sort( orderedList.begin(), orderedList.end(), [](Shape *a, Shape *b) { return *a < … Read more
No, but it gives similar behaviour. So what you have created is a pointer to an array of vectors. So you will end up with this: adj[0] = [] adj[1] = [] … adj[number_nodes] = [] and doing a push_back is a legitimate way to add to the vectors: adj[0].push_back(some_num) –> adj[0] = [some_num] But … Read more
When you write adj[0], you’re implicitly assuming that the vector has a size of at least 1, in order for the zeroth element to exist. This is not the case for an empty vector, such as a newly initialized one. Unfortunately, this does not guarantee an error of any kind, it is Undefined Behavior, and … Read more
why here vector <int> :: iterator i; The vector <int> :: iterator i; is created in order to traverse the vector vector <int> g1; (actually it can traverse any vector<int>, but in this case, that’s for g1) is there a difference between vector <int> :: iterator i; and int i? The scope of vector <int> … Read more
The problem is that you define a type (account) in the class. account is a type so you should not declare it in the class : struct account { std::string name; float money; short pin; }; and then, the class becomes : class CBank { public: CBank(); account acc; std::vector<account> add; }; and the main … Read more
The problem wasn’t the c++ code itself, but the framework it used, in this case ROOT. If you define a pointer in a ROOT class, you have to tell the program what to do with that pointer in the case of the class being written to file. Even though the class might never be written … Read more
Instead of printing result[0],result[1],result[2],first check the size of vector result and if it is ‘0’ then return 0 or whatever is given and otherwise return result vector. solved Core dumped while using vector
Well you are declaring an array of 20 vectors. So right way would be D[1].push_back(make_pair(0,make_pair(1,2)); int a = D[1][0].first; pair<int,int> b = D[1][0].second; b.second++; // You now have a pair containing increased value. Original remains unchanged. int z = D[1][0].second.second; // contains the nested pair’s second value If you want to increase the second – … Read more
Assumptions: using Lines = std::vector<std::vector<std::string>>; Lines current = { … }; // sorted on std::less<std::vector<std::string>> Lines input = { … }; // also sorted on std::less<std::vector<std::string>> Lines difference; Rather than doing std::set_difference(current.begin(), current.end(), input.begin(), input.end(), std::back_inserter(difference)); You should do auto compare = [](Lines::const_reference lhs, Lines::const_reference rhs) { assert(lhs.size() && rhs.size()) // same as default comparison, … Read more
I think your problem is that these lines: if (que1.empty()){ for (int m = j; m < counterq2; m++){ que_merge.push_back(que2.at(m)); } } else { for (int l = i; l < counterq1; ++l) { que_merge.push_back(que1.at(l)); } } doesn’t do what you expect. As far as I can see, your idea is to merge the remaining … Read more
Use the special end keyword: lastelement = myvector(end); solved Returning the last element of a vector with an unknown length [closed]
//Play Tic Tac Toe game between user and computer #include<iostream> #include<cstdio> #include<stdlib.h> #include<time.h> #define BLANK 5 using namespace std; /***************** Display the Matrix **********************************************/ //Display the matrix void display(int matrix[3][3]) { for(int i=0;i<3;i++){ for(int j=0;j<3;j++) cout<<matrix[i][j]<<“\t”; cout<<endl; } } /************** Chance of WIN Function *****************************************************/ //Funtion to detect the chance of either for user or … Read more
blah[j] = strInput; This is undefined behaviour because blah is empty. Which means the compiler can make the program do anything. When compiling with the right settings, Visual C++ makes use of that undefined behaviour in the C++ standard in order to actually detect the bug and show you this error message. Fix the bug … Read more
Change vector<int> result; to vector<int> result = numbers;. Replace all vector<string> to vector<int> and remove quote marks around numbers when you push_back them 2 solved Sorting numbers using vector in c++ [closed]
The function can look as it is shown in the demonstrative program #include <iostream> #include <algorithm> #include <vector> long long int solution( const std::vector<int> &v ) { long long int max_sum = 0; for ( auto it = v.begin(); ( it = std::find_if( it, v.end(), []( int x ) { return !( x < 0 … Read more