# Leetcode Length of Last Word problem solution

In this Leetcode Length of Last Word problem solution we have given a string s consists of some words separated by some number of spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only.

## Problem solution in Python.

```class Solution:
def lengthOfLastWord(self, s):
"""
:type s: str
:rtype: int
"""
return len(s.rstrip().split(' ')[-1])
```

## Problem solution in Java.

```class Solution {
public int lengthOfLastWord(String s) {
s = s.trim();
return s.length() - s.lastIndexOf(" ") - 1;
}
}
```

## Problem solution in C++.

```class Solution {
public:
int lengthOfLastWord(string s) {
stringstream ss(s);
string word;
while(ss >> word) {
}
return word.size();
}
};
```

## Problem solution in C.

```int lengthOfLastWord(string s)
{
string k;
int count  = 0;
int len = 0 ;
for (int i = 0; i < s.length(); i++)
{
if (s[i] != ' ')
{
count++;
len = count;
}
else
{
count = 0;
if (len < count)
{
len = count;
}
}
}
return len;
}
```