Comments by Member 13277493 (Top 42 by date)

thanks, I tried to understand using debugger but there were some problems I encountered, I will try again

thanks, I will think about it

thanks!

thanks, I will try that way

no, I just need to print the n-th prime number for each input data

thanks! I will try that way

yes its complex, the problem is from Project Euler. https://projecteuler.net/problem=13

yes, they are chars, and the istringstream is one of the ways(if not the only way) to get the integers from the string. In this case, the string does not contain any special delimiter.

But will the istringstream buffer accept it as an input? I tried like that, the IDE marks red below. Maybe I made a mistake in writing the code. The code is below. I didn't write the loop for each index of the member, for this example it's just the 0 index element of the string.

std::vector<std::vector<int>>iv;
for(const auto &row: sv)
{
iv.push_back(std::vector<int>());
for(const auto &v: row)
{
const auto v_at=v.at(0);
std::istringstream ss(v);
int i;
ss>>i;
iv.back().push_back(i);
}
}

I know that, my question is how can I store not the whole string in "i" but each element of the string then push it to the vector one by one

I needed only the numbers from 0 to 9, yes I think that I did not understand that code good enough

thanks!

thanks!

thanks!

the code is not running, it has some errors with overloaded operators

thanks for a good advice!

thank you very much, I will fix them. And one more question, they are as many linked lists as the vertices are, am I right? For each vertex, there is a linked list created by its adjacent vertices.

thanks!

That means I must connect the end node of the loop to nullptr, am I right?

thanks, it really helped

:)

oh thanks, I have forgotten to write else before the statements

I don't think so, I have not connected the last node to the first node why it must be circular

ok I will do that. now when I write this code it does not print 40 only
#include <iostream>
using namespace std;

struct node {
int value;
node *left, *right;
};
node *root;

class search_tree {

public:
search_tree()
{
root=NULL;
}
void copy(node *from_tree, int to_heap[] ,int i);
node *insert(node *m_node, int key);
void print(int to_heap[], int size);

};

node *newNode(int item)
{
node *temp=new node;
temp->value=item;
temp->left=NULL;
temp->right=NULL;
return temp;
}



node *search_tree::insert(node *m_node, int key)
{
if(m_node==NULL)
{
return newNode(key);

}
if(key<m_node->value)
{
m_node->left=insert(m_node->left, key);
}
if(key>=m_node->value)
{
m_node->right=insert(m_node->right, key);
}
return m_node;

}


void search_tree::copy(node *from_tree, int to_heap[], int i)
{

if(from_tree==NULL)
{
return;
}
to_heap[i]=from_tree->value;
i++;
copy(from_tree->left, to_heap, i);

int right=i+2;

copy(from_tree->right, to_heap, right);
right=i+2;

}

void search_tree::print(int to_heap[], int size)
{
for(int j=0; j<size; j++)
{
cout<<to_heap[j]<<endl;
}
}
int main()
{
search_tree tree;
node *root=NULL;
root=tree.insert(root, 50);
tree.insert(root, 30);
tree.insert(root, 20);
tree.insert(root, 40);
tree.insert(root, 70);
tree.insert(root, 60);
tree.insert(root, 50);
int size=7;
int to_heap[size]={};
int i=0;
tree.copy(root, to_heap, i);
tree.print(to_heap, size);

}

it gets incremented and decremented also

it gets incremented when the node is not null, it is the index of array that must be filled

thank you very much for responding, sadly I used debugger many times in this code and don't understand the problem, maybe I am not using debugger well

Thanks for helping. I must find question1 and traverse the left and right subtrees to find question2. yes?

sorry if my question is stupid but I wrote like this, this added true mark for also one test, I don't fully understand what happens with the array
bool almostIncreasingSequence(std::vector<int> sequence)
{
int count=0;
int i=0;

while(i<(sequence.size()-1))
{

if(sequence[i]>sequence[i+1])
{

sequence.erase(sequence.begin()+(i+1));
count++;

}
if(sequence[i]==sequence[i+1])
{
sequence.erase(sequence.begin()+i);
count++;
}
i++;


if(count>1)
{
return false;}
}

if(count<=1)
{
return true;
}

}

It works, but some tests are not working correctly.

#include <iostream>
#include <vector>
using namespace std;
bool almostIncreasingSequence(std::vector<int> sequence)
{
int count=0;
int i=0;

while(i<sequence.size()-1)
{
if(sequence[i]>=sequence[i+1])
{
count++;
sequence.erase(sequence.begin()+(i+1));
}
i++;

if(count>1)
{
return false;}
}

if(count<=1)
{
return true;
}

}


int main()
{
vector<int>arr{1,6,5,8,9};
cout<<almostIncreasingSequence(arr)<<endl;


}
is this the right code?

this is a problem in codefights website, they are some tests that this problem does not pass.

thank you very much for answer, but can you explain what do you mean by splitting them out? :)