blocks|key|1168475|text|void+ExplodeString(+const+std::string&+string,+const+char+separator,+std::list<int>&+result+)+{
++++if(+string.size()+)+{
++++++++std::string::const_iterator+last+=+string.begin();
++++++++for(+std::string::const_iterator+i=string.begin();+i!=string.end();+%2B%2Bi+)+{
++++++++++++if(+*i+==+separator+)+{
++++++++++++++++const+std::string+str(last,i);
++++++++++++++++int+id+=+atoi(str.c_str());
++++++++++++++++result.push_back(id);
++++++++++++++++last+=+i;
++++++++++++++++%2B%2B+last;
++++++++++++}
++++++++}
++++++++if(+last+!=+string.end()+)+result.push_back(+atoi(&*last)+);
++++}
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1168476|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>void ExplodeString( const std::string&amp; string, const char separator, std::list&lt;int&gt;&amp; result ) {
 if( string.size() ) {
 std::string::const_iterator last = string.begin();
 for( std::string::const_iterator i=string.begin(); i!=string.end(); ++i ) {
 if( *i == separator ) {
 const std::string str(last,i);
 int id = atoi(str.c_str());
 result.push_back(id);
 last = i;
 ++ last;
 }
 }
 if( last != string.end() ) result.push_back( atoi(&amp;*last) );
 }
}
</code></pre>

blocks|key|1383571|text|std::string+input="1,1,1,1,2,1,1,1,0";
std::vector<long>+output;
for(std::string::size_type+p0=0,p1=input.find(',');
++++++++p1!=std::string::npos+%7C%7C+p0!=std::string::npos;
++++++++(p0=(p1==std::string::npos)?p1:%2B%2Bp1),p1=input.find(',',p0)+)
++++output.push_back(+strtol(input.c_str()%2Bp0,NULL,0)+);|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1383572|当然，在strtol()中检查转换错误是一个好主意。也许代码也可以从其他一些错误检查中受益。|unstyled|offset|length|style|CODE|1383573|entityMap^0|0|4|8|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|N|8|@$G|O|H|P|I|J]]|9|@]|A|$]]|$1|K|3|-4|5|F|7|Q|8|@]|9|@]|A|$]]]|L|$]]

<pre><code>std::string input="1,1,1,1,2,1,1,1,0";
std::vector&lt;long&gt; output;
for(std::string::size_type p0=0,p1=input.find(',');
 p1!=std::string::npos || p0!=std::string::npos;
 (p0=(p1==std::string::npos)?p1:++p1),p1=input.find(',',p0) )
 output.push_back( strtol(input.c_str()+p0,NULL,0) );
</code></pre>

It would be a good idea to check for conversion errors in <code>strtol()</code>, of course. Maybe the code may benefit from some other error checks as well.

blocks|key|1383610|text|一次输入一个数字，检查下面的字符是否为,。如果是，则将其丢弃。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1383611|#include+<vector>
#include+<string>
#include+<sstream>
#include+<iostream>

int+main()
{
++++std::string+str+=+"1,2,3,4,5,6";
++++std::vector<int>+vect;

++++std::stringstream+ss(str);

++++for+(int+i;+ss+>>+i;)+{
++++++++vect.push_back(i);++++
++++++++if+(ss.peek()+==+',')
++++++++++++ss.ignore();
++++}

++++for+(std::size_t+i+=+0;+i+<+vect.size();+i%2B%2B)
++++++++std::cout+<<+vect[i]+<<+std::endl;
}|code-block|syntax|javascript|1383612|entityMap^0|J|1|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@$9|N|A|O|B|C]]|D|@]|E|$]]|$1|F|3|G|5|H|7|P|8|@]|D|@]|E|$I|J]]|$1|K|3|-4|5|6|7|Q|8|@]|D|@]|E|$]]]|L|$]]

Input one number at a time, and check whether the following character is <code>,</code>. If so, discard it.

<pre><code>#include &lt;vector&gt;
#include &lt;string&gt;
#include &lt;sstream&gt;
#include &lt;iostream&gt;

int main()
{
 std::string str = "1,2,3,4,5,6";
 std::vector&lt;int&gt; vect;

 std::stringstream ss(str);

 for (int i; ss &gt;&gt; i;) {
 vect.push_back(i); 
 if (ss.peek() == ',')
 ss.ignore();
 }

 for (std::size_t i = 0; i &lt; vect.size(); i++)
 std::cout &lt;&lt; vect[i] &lt;&lt; std::endl;
}
</code></pre>

blocks|key|1168632|text|#include+<sstream>
#include+<vector>

const+char+*input+=+"1,1,1,1,2,1,1,1,0";

int+main()+{
++++std::stringstream+ss(input);
++++std::vector<int>+output;
++++int+i;
++++while+(ss+>>+i)+{
++++++++output.push_back(i);
++++++++ss.ignore(1);
++++}
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1168633|错误的输入(例如连续的分隔符)会把事情搞得一团糟，但你确实说了简单。|unstyled|1168634|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|J|8|@]|9|@]|A|$]]|$1|G|3|-4|5|F|7|K|8|@]|9|@]|A|$]]]|H|$]]

<pre><code>#include &lt;sstream&gt;
#include &lt;vector&gt;

const char *input = "1,1,1,1,2,1,1,1,0";

int main() {
 std::stringstream ss(input);
 std::vector&lt;int&gt; output;
 int i;
 while (ss &gt;&gt; i) {
 output.push_back(i);
 ss.ignore(1);
 }
}
</code></pre>

Bad input (for instance consecutive separators) will mess this up, but you did say simple.

blocks|key|1168696|text|使用通用算法和Boost.Tokenizer的替代解决方案|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1168697|struct+ToInt
{
++++int+operator()(string+const+&str)+{+return+atoi(str.c_str());+}
};

string+values+=+"1,2,3,4,5,9,8,7,6";

vector<int>+ints;
tokenizer<>+tok(values);

transform(tok.begin(),+tok.end(),+back_inserter(ints),+ToInt());|code-block|syntax|javascript|1168698|entityMap|0|LINK|mutability|MUTABLE|url|http://www.boost.org/doc/libs/1_41_0/libs/tokenizer/index.html^0|7|F|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

Alternative solution using generic algorithms and <a href="http://www.boost.org/doc/libs/1_41_0/libs/tokenizer/index.html" rel="noreferrer">Boost.Tokenizer</a>:

<pre><code>struct ToInt
{
 int operator()(string const &amp;str) { return atoi(str.c_str()); }
};

string values = "1,2,3,4,5,9,8,7,6";

vector&lt;int&gt; ints;
tokenizer&lt;&gt; tok(values);

transform(tok.begin(), tok.end(), back_inserter(ints), ToInt());
</code></pre>

blocks|key|1383727|text|bool+GetList+(const+std::string&+src,+std::vector<int>&+res)
++{
++++using+boost::lexical_cast;
++++using+boost::bad_lexical_cast;
++++bool+success+=+true;
++++typedef+boost::tokenizer<boost::char_separator<char>+>+tokenizer;
++++boost::char_separator<char>+sepa(",");
++++tokenizer+tokens(src,+sepa);
++++for+(tokenizer::iterator+tok_iter+=+tokens.begin();+
+++++++++tok_iter+!=+tokens.end();+%2B%2Btok_iter)+{
++++++try+{
++++++++res.push_back(lexical_cast<int>(*tok_iter));
++++++}
++++++catch+(bad_lexical_cast+&)+{
++++++++success+=+false;
++++++}
++++}
++++return+success;
++}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1383728|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>bool GetList (const std::string&amp; src, std::vector&lt;int&gt;&amp; res)
 {
 using boost::lexical_cast;
 using boost::bad_lexical_cast;
 bool success = true;
 typedef boost::tokenizer&lt;boost::char_separator&lt;char&gt; &gt; tokenizer;
 boost::char_separator&lt;char&gt; sepa(",");
 tokenizer tokens(src, sepa);
 for (tokenizer::iterator tok_iter = tokens.begin(); 
 tok_iter != tokens.end(); ++tok_iter) {
 try {
 res.push_back(lexical_cast&lt;int&gt;(*tok_iter));
 }
 catch (bad_lexical_cast &amp;) {
 success = false;
 }
 }
 return success;
 }
</code></pre>

blocks|key|1168775|text|还有另一种相当不同的方法:使用特殊的区域设置，将逗号视为空格：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1168776|#include+<locale>
#include+<vector>

struct+csv_reader:+std::ctype<char>+{
++++csv_reader():+std::ctype<char>(get_table())+{}
++++static+std::ctype_base::mask+const*+get_table()+{
++++++++static+std::vector<std::ctype_base::mask>+rc(table_size,+std::ctype_base::mask());

++++++++rc[',']+=+std::ctype_base::space;
++++++++rc['\n']+=+std::ctype_base::space;
++++++++rc['+']+=+std::ctype_base::space;
++++++++return+&rc[0];
++++}
};+|code-block|syntax|javascript|1168777|要使用此方法，您需要使用包含此facet的语言环境imbue()一个流。一旦你这样做了，你就可以读取数字，就好像逗号根本不存在一样。例如，我们将从输入中读取逗号分隔的数字，然后在标准输出中每行写出一个：|offset|length|style|CODE|1168778|#include+<algorithm>
#include+<iterator>
#include+<iostream>

int+main()+{
++++std::cin.imbue(std::locale(std::locale(),+new+csv_reader()));
++++std::copy(std::istream_iterator<int>(std::cin),+
++++++++++++++std::istream_iterator<int>(),
++++++++++++++std::ostream_iterator<int>(std::cout,+"\n"));
++++return+0;
}|1168779|entityMap^0|0|0|P|7|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|R|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|S|8|@$I|T|J|U|K|L]]|9|@]|A|$]]|$1|M|3|N|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|O|3|-4|5|6|7|W|8|@]|9|@]|A|$]]]|P|$]]

Yet another, rather different, approach: use a special locale that treats commas as white space:

<pre><code>#include &lt;locale&gt;
#include &lt;vector&gt;

struct csv_reader: std::ctype&lt;char&gt; {
 csv_reader(): std::ctype&lt;char&gt;(get_table()) {}
 static std::ctype_base::mask const* get_table() {
 static std::vector&lt;std::ctype_base::mask&gt; rc(table_size, std::ctype_base::mask());

 rc[','] = std::ctype_base::space;
 rc['\n'] = std::ctype_base::space;
 rc[' '] = std::ctype_base::space;
 return &amp;rc[0];
 }
}; 
</code></pre>

To use this, you <code>imbue()</code> a stream with a locale that includes this facet. Once you've done that, you can read numbers as if the commas weren't there at all. Just for example, we'll read comma-delimited numbers from input, and write then out one-per line on standard output:

<pre><code>#include &lt;algorithm&gt;
#include &lt;iterator&gt;
#include &lt;iostream&gt;

int main() {
 std::cin.imbue(std::locale(std::locale(), new csv_reader()));
 std::copy(std::istream_iterator&lt;int&gt;(std::cin), 
 std::istream_iterator&lt;int&gt;(),
 std::ostream_iterator&lt;int&gt;(std::cout, "\n"));
 return 0;
}
</code></pre>

blocks|key|1168846|text|C%2B%2B+String+Toolkit+Library+(Strtk)针对您的问题提供了以下解决方案：|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1168847|#include+<string>
#include+<deque>
#include+<vector>
#include+"strtk.hpp"
int+main()
{+
+++std::string+int_string+=+"1,2,3,4,5,6,7,8,9,10,11,12,13,14,15";
+++std::vector<int>+int_list;
+++strtk::parse(int_string,",",int_list);

+++std::string+double_string+=+"123.456%7C789.012%7C345.678%7C901.234%7C567.890";
+++std::deque<double>+double_list;
+++strtk::parse(double_string,"%7C",double_list);

+++return+0;
}|code-block|syntax|javascript|1168848|有关更多示例，请访问Here|1168849|entityMap|0|LINK|mutability|MUTABLE|url|http://www.partow.net/programming/strtk/index.html|1|http://www.codeproject.com/KB/recipes/Tokenizer.aspx^0|0|Y|0|0|0|A|4|1|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|6|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]|$1|K|3|-4|5|6|7|13|8|@]|9|@]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

The <a href="http://www.partow.net/programming/strtk/index.html" rel="noreferrer">C++ String Toolkit Library (Strtk)</a> has the following solution to your problem:

<pre><code>#include &lt;string&gt;
#include &lt;deque&gt;
#include &lt;vector&gt;
#include "strtk.hpp"
int main()
{ 
 std::string int_string = "1,2,3,4,5,6,7,8,9,10,11,12,13,14,15";
 std::vector&lt;int&gt; int_list;
 strtk::parse(int_string,",",int_list);

 std::string double_string = "123.456|789.012|345.678|901.234|567.890";
 std::deque&lt;double&gt; double_list;
 strtk::parse(double_string,"|",double_list);

 return 0;
}
</code></pre>

More examples can be found <a href="http://www.codeproject.com/KB/recipes/Tokenizer.aspx" rel="noreferrer">Here</a>

blocks|key|1383922|text|#include+<sstream>
#include+<vector>
#include+<algorithm>
#include+<iterator>

const+char+*input+=+",,29870,1,abc,2,1,1,1,0";
int+main()
{
++++std::stringstream+ss(input);
++++std::vector<int>+output;
++++int+i;
++++while+(+!ss.eof()+)
++++{
+++++++int+c+=++ss.peek()+;
+++++++if+(+c+<+'0'+%7C%7C+c+>+'9'+)
+++++++{
++++++++++ss.ignore(1);
++++++++++continue;
++++++++}

+++++++if+(ss+>>+i)
+++++++{
++++++++++output.push_back(i);
++++++++}

++++}

++++std::copy(output.begin(),+output.end(),+std::ostream_iterator<int>+(std::cout,+"+")+);
++++return+0;
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1383923|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>#include &lt;sstream&gt;
#include &lt;vector&gt;
#include &lt;algorithm&gt;
#include &lt;iterator&gt;

const char *input = ",,29870,1,abc,2,1,1,1,0";
int main()
{
 std::stringstream ss(input);
 std::vector&lt;int&gt; output;
 int i;
 while ( !ss.eof() )
 {
 int c = ss.peek() ;
 if ( c &lt; '0' || c &gt; '9' )
 {
 ss.ignore(1);
 continue;
 }

 if (ss &gt;&gt; i)
 {
 output.push_back(i);
 }

 }

 std::copy(output.begin(), output.end(), std::ostream_iterator&lt;int&gt; (std::cout, " ") );
 return 0;
}
</code></pre>

blocks|key|1384001|text|一些不太冗长的东西，std和任何用逗号分隔的东西。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1384002|stringstream+ss(+"1,1,1,1,+or+something+else+,1,1,1,0"+);
vector<string>+result;

while(+ss.good()+)
{
++++string+substr;
++++getline(+ss,+substr,+','+);
++++result.push_back(+substr+);
}|code-block|syntax|javascript|1384003|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Something less verbose, std and takes anything separated by a comma.

<pre><code>stringstream ss( "1,1,1,1, or something else ,1,1,1,0" );
vector&lt;string&gt; result;

while( ss.good() )
{
 string substr;
 getline( ss, substr, ',' );
 result.push_back( substr );
}
</code></pre>

blocks|key|1384070|text|您还可以使用以下函数。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1384071|void+tokenize(const+string&+str,+vector<string>&+tokens,+const+string&+delimiters+=+",")
{
++//+Skip+delimiters+at+beginning.
++string::size_type+lastPos+=+str.find_first_not_of(delimiters,+0);

++//+Find+first+non-delimiter.
++string::size_type+pos+=+str.find_first_of(delimiters,+lastPos);

++while+(string::npos+!=+pos+%7C%7C+string::npos+!=+lastPos)+{
++++//+Found+a+token,+add+it+to+the+vector.
++++tokens.push_back(str.substr(lastPos,+pos+-+lastPos));

++++//+Skip+delimiters.
++++lastPos+=+str.find_first_not_of(delimiters,+pos);

++++//+Find+next+non-delimiter.
++++pos+=+str.find_first_of(delimiters,+lastPos);
++}
}|code-block|syntax|javascript|1384072|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

You could also use the following function.

<pre><code>void tokenize(const string&amp; str, vector&lt;string&gt;&amp; tokens, const string&amp; delimiters = ",")
{
 // Skip delimiters at beginning.
 string::size_type lastPos = str.find_first_not_of(delimiters, 0);

 // Find first non-delimiter.
 string::size_type pos = str.find_first_of(delimiters, lastPos);

 while (string::npos != pos || string::npos != lastPos) {
 // Found a token, add it to the vector.
 tokens.push_back(str.substr(lastPos, pos - lastPos));

 // Skip delimiters.
 lastPos = str.find_first_not_of(delimiters, pos);

 // Find next non-delimiter.
 pos = str.find_first_of(delimiters, lastPos);
 }
}
</code></pre>

blocks|key|1169066|text|string+exp+=+"token1+token2+token3";
char+delimiter+=+'+';
vector<string>+str;
string+acc+=+"";
for(int+i+=+0;+i+<+exp.size();+i%2B%2B)
{
++++if(exp[i]+==+delimiter)
++++{
++++++++str.push_back(acc);
++++++++acc+=+"";
++++}
++++else
++++++++acc+%2B=+exp[i];
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|1169067|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>string exp = "token1 token2 token3";
char delimiter = ' ';
vector&lt;string&gt; str;
string acc = "";
for(int i = 0; i &lt; exp.size(); i++)
{
 if(exp[i] == delimiter)
 {
 str.push_back(acc);
 acc = "";
 }
 else
 acc += exp[i];
}
</code></pre>

blocks|key|1384180|text|结构简单，适应性强，易于维护。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1384181|std::string+stringIn+=+"my,csv,,is+10233478,separated,by+commas";
std::vector<std::string>+commaSeparated(1);
int+commaCounter+=+0;
for+(int+i=0;+i<stringIn.size();+i%2B%2B)+{
++++if+(stringIn[i]+==+",")+{
++++++++commaSeparated.push_back("");
++++++++commaCounter%2B%2B;
++++}+else+{
++++++++commaSeparated.at(commaCounter)+%2B=+stringIn[i];
++++}
}|code-block|syntax|javascript|1384182|最后，您将拥有一个字符串向量，句子中的每个元素都由空格分隔。空字符串另存为单独的项。|1384183|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

simple structure, easily adaptable, easy maintenance. 

<pre><code>std::string stringIn = "my,csv,,is 10233478,separated,by commas";
std::vector&lt;std::string&gt; commaSeparated(1);
int commaCounter = 0;
for (int i=0; i&lt;stringIn.size(); i++) {
 if (stringIn[i] == ",") {
 commaSeparated.push_back("");
 commaCounter++;
 } else {
 commaSeparated.at(commaCounter) += stringIn[i];
 }
}
</code></pre>

in the end you will have a vector of strings with every element in the sentence separated by spaces. empty strings are saved as separate items.

blocks|key|1169164|text|简单的复制/粘贴功能，基于boost+tokenizer。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|1169165|void+strToIntArray(std::string+string,+int*+array,+int+array_len)+{
++boost::tokenizer<>+tok(string);
++int+i+=+0;
++for(boost::tokenizer<>::iterator+beg=tok.begin();+beg!=tok.end();%2B%2Bbeg){
++++if(i+<+array_len)
++++++array[i]+=+atoi(beg->c_str());
++++i%2B%2B;
}|code-block|syntax|javascript|1169166|entityMap|0|LINK|mutability|MUTABLE|url|http://www.boost.org/doc/libs/1_41_0/libs/tokenizer/index.html^0|D|F|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

Simple Copy/Paste function, based on the <a href="http://www.boost.org/doc/libs/1_41_0/libs/tokenizer/index.html" rel="nofollow">boost tokenizer</a>.

<pre><code>void strToIntArray(std::string string, int* array, int array_len) {
 boost::tokenizer&lt;&gt; tok(string);
 int i = 0;
 for(boost::tokenizer&lt;&gt;::iterator beg=tok.begin(); beg!=tok.end();++beg){
 if(i &lt; array_len)
 array[i] = atoi(beg-&gt;c_str());
 i++;
}
</code></pre>

blocks|key|1384303|text|我还不能评论(开始在这个网站上)，但在他的帖子中添加了Jerry+Coffin的fantastic+ctype的派生类的更通用的版本。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1384304|谢谢Jerry的超级点子。|1384305|(因为它必须经过同行评审，在这里临时添加)|1384306|struct+SeparatorReader:+std::ctype<char>
{
++++template<typename+T>
++++SeparatorReader(const+T+&seps):+std::ctype<char>(get_table(seps),+true)+{}

++++template<typename+T>
++++std::ctype_base::mask+const+*get_table(const+T+&seps)+{
++++++++auto+&&rc+=+new+std::ctype_base::mask[std::ctype<char>::table_size]();
++++++++for(auto+&&sep:+seps)
++++++++++++rc[static_cast<unsigned+char>(sep)]+=+std::ctype_base::space;
++++++++return+&rc[0];
++++}
};|code-block|syntax|javascript|1384307|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|N|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|O|8|@]|9|@]|A|$]]|$1|F|3|G|5|H|7|P|8|@]|9|@]|A|$I|J]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

I cannot yet comment (getting started on the site) but added a more generic version of Jerry Coffin's fantastic ctype's derived class to his post.

Thanks Jerry for the super idea.

(Because it must be peer-reviewed, adding it here too temporarily)

<pre><code>struct SeparatorReader: std::ctype&lt;char&gt;
{
 template&lt;typename T&gt;
 SeparatorReader(const T &amp;seps): std::ctype&lt;char&gt;(get_table(seps), true) {}

 template&lt;typename T&gt;
 std::ctype_base::mask const *get_table(const T &amp;seps) {
 auto &amp;&amp;rc = new std::ctype_base::mask[std::ctype&lt;char&gt;::table_size]();
 for(auto &amp;&amp;sep: seps)
 rc[static_cast&lt;unsigned char&gt;(sep)] = std::ctype_base::space;
 return &amp;rc[0];
 }
};
</code></pre>

blocks|key|1384331|text|令我惊讶的是，还没有人提出使用std::regex的解决方案：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1384332|#include+<string>
#include+<algorithm>
#include+<vector>
#include+<regex>

void+parse_csint(+const+std::string&+str,+std::vector<int>&+result+)+{

++++typedef+std::regex_iterator<std::string::const_iterator>+re_iterator;
++++typedef+re_iterator::value_type+re_iterated;

++++std::regex+re("(\\d%2B)");

++++re_iterator+rit(+str.begin(),+str.end(),+re+);
++++re_iterator+rend;

++++std::transform(+rit,+rend,+std::back_inserter(result),+
++++++++[](+const+re_iterated&+it+){+return+std::stoi(it[1]);+}+);

}|code-block|syntax|javascript|1384333|此函数用于在输入向量的后面插入所有整数。您可以调整正则表达式，使其包含负整数或浮点数等。|1384334|entityMap|0|LINK|mutability|MUTABLE|url|http://www.cplusplus.com/reference/regex/^0|F|A|F|A|0|0|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@$9|V|A|W|B|C]]|D|@$9|X|A|Y|1|Z]]|E|$]]|$1|F|3|G|5|H|7|10|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|11|8|@]|D|@]|E|$]]|$1|M|3|-4|5|6|7|12|8|@]|D|@]|E|$]]]|N|$O|$5|P|Q|R|E|$S|T]]]]

I'm surprised no one has proposed a solution using <a href="http://www.cplusplus.com/reference/regex/" rel="nofollow noreferrer"><code>std::regex</code></a> yet:

<pre><code>#include &lt;string&gt;
#include &lt;algorithm&gt;
#include &lt;vector&gt;
#include &lt;regex&gt;

void parse_csint( const std::string&amp; str, std::vector&lt;int&gt;&amp; result ) {

 typedef std::regex_iterator&lt;std::string::const_iterator&gt; re_iterator;
 typedef re_iterator::value_type re_iterated;

 std::regex re("(\\d+)");

 re_iterator rit( str.begin(), str.end(), re );
 re_iterator rend;

 std::transform( rit, rend, std::back_inserter(result), 
 []( const re_iterated&amp; it ){ return std::stoi(it[1]); } );

}
</code></pre>

This function inserts all integers at the back of the input vector. You can tweak the regular expression to include negative integers, or floating point numbers, etc.

blocks|key|1169369|text|这是我经常使用的最简单的方法。它适用于任何单字符分隔符。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1169370|#include<bits/stdc%2B%2B.h>
using+namespace+std;

int+main()+{
+++string+str;

+++cin+>>+str;
+++int+temp;
+++vector<int>+result;
+++char+ch;
+++stringstream+ss(str);

+++do
+++{
+++++++ss>>temp;
+++++++result.push_back(temp);
+++}while(ss>>ch);

+++for(int+i=0+;+i+<+result.size()+;+i%2B%2B)
+++++++cout<<result[i]<<endl;

+++return+0;
}|code-block|syntax|javascript|1169371|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

This is the simplest way, which I used a lot. It works for any one-character delimiter.

<pre><code>#include&lt;bits/stdc++.h&gt;
using namespace std;

int main() {
 string str;

 cin &gt;&gt; str;
 int temp;
 vector&lt;int&gt; result;
 char ch;
 stringstream ss(str);

 do
 {
 ss&gt;&gt;temp;
 result.push_back(temp);
 }while(ss&gt;&gt;ch);

 for(int i=0 ; i &lt; result.size() ; i++)
 cout&lt;&lt;result[i]&lt;&lt;endl;

 return 0;
}
</code></pre>

If I have a std::string containing a comma-separated list of numbers, what's the simplest way to parse out the numbers and put them in an integer array?

I don't want to generalise this out into parsing anything else. Just a simple string of comma separated integer numbers such as "1,1,1,1,2,1,1,1,0".

Parsing a comma-delimited std::string

如果我有一个包含逗号分隔的数字列表的std::string，那么解析出数字并将它们放入整数数组的最简单方法是什么？我不想将其概括为解析任何其他内容。只是一个简单的逗号分隔的整数字符串，比如"1,1,1,1,2,1,1,1,0“。

问解析逗号分隔的std::string
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问解析逗号分隔的std::stringEN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问解析逗号分隔的std::string
EN