Leetcode first brush _ Length of Last Word

I don't quite understand the intention of the subject. In fact, it is too simple to use java for this question. Use split to process it and get an array of all words, then the length of the last one is enough. I personally think that the most successful function in java is split, which is almost always used in engineering and convenient and powerful.

C ++ is a little more complicated, but this is also the simplest string problem. The function interface determines that the length of the string is unknown. You need to find the character that is not equal to space in a loop, and then find the last word from the tail header, then accumulate until the space ends.

Class Solution {public: int lengthOfLastWord (const char * s) {if (s = NULL) return 0; int len = 0, res = 0; while (s [len]! = '\ 0') len ++; len --; while (s [len] = '') len --; while (len> = 0 & s [len]! = '') {Len --; res ++;} return res ;}};