關於C語言逆序字符串的相關代碼！

解決問題的時間首先想到的是搜索引擎，並不是大腦。現在的習慣都變完了！！

//此段代碼以解決以下方式的逆序 //原字符串: who is your name; //目標字符: ;eman ruoy si ohw #include <iostream> using namespace std; #define Max 200 int main() { char str[Max]; printf("請輸入文本:"); gets(str); int len=0; char *strlen=str; char *left=str; char temp; while(*strlen++) { len++; } strlen-=2; while(left!=strlen) { temp=*left; *left++=*strlen; *strlen--=temp; } printf("逆序後的字符串爲:"); for(int i=0;i<len;i++) { printf("%c",str[i]); } printf("/n"); system("pause"); return 0; }

 

//此段代碼是以按單詞來逆序 #include <iostream> #include <assert.h> using namespace std; #define Max 200 char* ReversedText(char *originalText) { int textLength = 0; int wordCount = 0; int wordlength = 0; char reversingText[Max]; int i = 0; int j = 0; assert(originalText != NULL); textLength = strlen(originalText); reversingText[textLength] = '/0'; printf("輸入文本:/"%s/"/n", originalText); while (i < textLength) { for (j = i; (j < textLength) && (isalnum(originalText[j]) || ('-' == originalText[j])); j++) { //blank block } wordlength = j-i; if (wordlength > 0) { memcpy(reversingText + textLength - j, originalText + i,wordlength); wordCount++; wordlength = 0; } else { //Blank block } if (j < textLength) { reversingText[textLength - j - 1] = originalText[j]; } else { break; } i = j+1; } reversingText[textLength] = '/0'; memcpy(originalText, reversingText, textLength); printf("逆序文本:/"%s/"/n",originalText); return originalText; } int main() { char str[Max]; printf("請輸入文本:"); gets(str); ReversedText(str); printf("/n"); system("pause"); return 0; }

 

#include "stdio.h" #include <iostream> using namespace std; //原:"What is your name+" //目:"name+ your is What" int main(void) { char s[]="What is your name+" ; char *a = NULL ; int l = strlen(s) - 1 ; while( l-- >= 0 ) { if ( *(s+l) == ' ' || !l ) { a = s + l + ( ( l ) ? ( 1 ) : ( 0 ) ) ; while ( *a && *a != ' ' ) putchar( *a++ ) ; putchar(' ') ; } } printf("/n"); system("pause"); return 0 ; }

以上代碼段在VS2008下測試通過.