Â¥Ö÷

C++Ëã·¨ Design an algorithm that makes the text following treatment: Remove vowels except those that are part of a group of consecutive vowels at the beginning of word. Stock ∙ clog the segments formed by a single consonant length greater than 1, a long one. Assume that a consonant is a character that is not a member, or a '. " or a '. ÒªÓÃC++×ö£¬µ«ÊÇÎÒ²»»á¡£ÄÄλ´óÏÀ»á°¡£¡£¡Íò·Ö¸Ð¼¤¡£@    Êղؠ  ·ÖÏí   ¶¥(0)

	µÚ2Â¥

±¾ÈËÓ¢Óï·Ç³£²Ë,³ÌÐòÒ²ÊDzËÄñ,×÷¸ö¼òµ¥µÄ¹¦ÄÜ.Ô­ÎÄ¿´²»¶® ºóÃæµÄ¸ü²»Ã÷°×. Ô­ÎÄ¿´²»¶®Ê²Ã´Òâ˼ ÊDz»ÊÇ°Ñÿ¸öµ¥´ÊµÄÊ׸öÔªÒô×Öĸȥµô.дÁ˸ö´ð·ÇËùÎʵÄ.ºÙºÙ #include "stdafx.h" #include <string> #include <iostream> using namespace std; int main() {  string stext ("just use for test,a simple example.");  cout << stext << endl;  cout << "ÔªÒô×Öĸ: ";  size_t cp;  cp = stext.find_first_of("aeiou");  while(cp != string::npos)   {   cout << stext.at(cp) << " " ;   cp = stext.find_first_of("aeiou", cp + 1);  }  cout << endl;  return 0; }