Length of Last Word

Original question link: http://oj.leetcode.com/problems/length-of-last-word/
This question is relatively simple, that is, to perform a string operation. The only detail is to remove the trailing space, read the next space, and record the length. The time complexity is O (n), n is the length of the string, and the space complexity is O (1 ). The Code is as follows:

Public int lengthOfLastWord (String s) {if (s = null | s. length () = 0) return 0; int idx = s. length ()-1; while (idx> = 0 & s. charAt (idx) = '') idx --; int idx2 = idx; while (idx2> = 0 & s. charAt (idx2 )! = '') Idx2 --; return idx-idx2 ;}

This type of question is relatively simple. It examines the simplest code implementation, which is generally the first basic question for the interview. This kind of question should be careful and cannot be implemented with bugs.