LeetCode-Easy部分中标签为String 58. Length of Last Word
2017-04-07 16:10
671 查看
原题
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.
实现代码
方法一public int LengthOfLastWord1(string s) { s = s.Trim(); //去掉前,后空格 if (s == "") return 0; string[] splitstring = s.Split(' '); string slast = splitstring[splitstring.Length - 1]; return slast.Length == 0 ? 1 : slast.Length; }
方法二
public int LengthOfLastWord2(string s) { s = s.Trim(); if (s == "") return 0; for (int i = s.Length-1;i>0; i--) { if (s[i] == ' ') return s.Length - i - 1; } return s.Length; }
相关文章推荐
- LeetCode58. Length of Last Word-python(easy)
- LeetCode-Easy部分中标签为String 14. Longest Common Prefix
- LeetCode-Easy部分中标签为String 520. Detect Capital
- LeetCode-Easy部分中标签为String 459. Repeated Substring Pattern
- LeetCode-Easy部分中标签为String 383. Ransom Note
- LeetCode-Easy部分中标签为String的所有题目
- Leetcode 58. Length of Last Word (Easy) (cpp)
- LeetCode-Easy部分中标签为String 434. Number of Segments in a String
- leetcode 58. Length of Last Word(easy)
- LeetCode-Easy部分中标签为Array的所有题目
- LeetCode-Easy部分中标签为Array#414 : Third Maximum Number
- LeetCode-Easy部分标签为LinkedList 141 Linked List Cycle
- LeetCode-Easy部分中标签为Two Pointers 125. Valid Palindrome
- LeetCode-Easy部分中标签为Two Pointers 88. Merge Sorted Array
- LeetCode - 58. Length of Last Word
- [LeetCode]--58. Length of Last Word
- leetcode-58. Length of Last Word
- 【Leetcode】58. Length of Last Word
- LeetCode刷题(C++)——Length of Last Word(Easy)
- LeetCode 58. Length of Last Word