字符串问题 求最后一个单词的长度

#include<iostream>//好
#include<string>
#include<vector>
using namespace std;
int main(){
string input;
vector<string>arr;
while (cin >> input){
arr.push_back(input);
}
cout << arr[arr.size() - 1].length() << endl;
return 0;
}

#include<iostream>
#include<string.h>

using namespace std;

/*

int length(char*str)
{
int n = 0;
int m;
m = sizeof(str) / sizeof(str[0]);
char*  p = str[m - 1];
while (*p)
{
p++;
n++;
}
return n;


}
*/



int main()
{
char*str[2] = { "absib","t"};
int n = 0;
int m;
m = sizeof(str) / sizeof(str[0]);
char*  p = str[m - 1];
while (*p)
{
p++;
n++;
}

printf("%d\n", n);
//printf("%d\n", length(str));
return 0;
}






#include<iostream>
#include<string>
#include<string.h>
using namespace std;
int main()
{
//string str="123";
string str;
char str1[5000];
//char* str1;
char* p = str1;
//scanf("%s", str1); //www 22
//
//cout << str1 << endl;//www
//cin >>str1;  www 22
//cout << str1 << endl;//www
gets(p);//scanf cin 空格tab也是分隔符   gets换行才是分隔符但不接受换行
//strcpy(str1,str.c_str());//c不可以用=来赋值字符串
//str1=c_str(str);//error


/*for (int j = strlen(str1) - 1; j<0; j--)
{
if (p[j] != ' ')
{
p[j + 1] = '\0';
break;
}

}*/ //可有可无
if (!*str1)
{
cout << 0;
return 0;
}
str = str1;
int m = str.rfind(" ");
int t ;
/*for (int i = m; i<str.length; i++)
{
cout << str[i];


}*/
//int t = strlen(str1);
//cout << t << endl;
//cout << m;
t = strlen(str1) - 1 - m;
/*cout << m;
t = t - m;
cout <<t;*/
cout << t;

}

http://www.nowcoder.com/questionTerminal/8c949ea5f36f422594b306a2300315da?toCommentId=80789