LeetCode-Length of Last Word

Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string.

If the last word does not exist, return 0.

Note: A word is defined as a character sequence consists of non-space characters only.

For example, 
Given s = "Hello World",
return 5.

class Solution {
public:
    int lengthOfLastWord(const char *s) {
  	int i = 0;
	int count = 0;
	int space = 0;
	while(s[i]!='\0')
	{
		i++;
	}
	while(s[i-space-1]==' ')
	{
		space++;
	}
	while(s[i-space-count-1]!=' '&&(i-space-count-1)>=0)
	{
		count++;
	}
	return count;
    }
};

对于字符数组长度的计算：

char* str[] = "what a beautiful day"
length = sizeof(str)/sizeof(char)

但是当数组作为参数传入子函数时，不能再用这个公式，这是的sizeof(str)代表的是字符串首地址的字节数！！！