class Solution {
public:
int lengthOfLastWord(string s) {
if (s.size() == 0)
return 0;
int count = 0;
int i = s.size() - 1;
while (i >= 0 && s[i] == ' ')
{
--i;
}
while (i >= 0 && s[i] != ' ')
{
count++;
if (s[i] == ' ')
break;
--i;
}
return count;
}
};
class Solution {
public:
void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
nums1.resize(nums1.size() - nums2.size());
for (int i = 0; i < nums2.size(); ++i)
{
nums1.push_back(nums2[i]);
}
sort(nums1.begin(), nums1.end());
}
};