• LeetCode Length of Last Word


    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.

    题意:推断最后一个单词的长度。

    class Solution {
    public:
        int lengthOfLastWord(const char *s) {
            int count = 0, last = 0;
            while (*s != '') {
                count = (*s == ' ') ? 0 : count+1;
                last = count > 0 ? count : last;
                s++;
            }
    
            return last;
        }
    };

    public class Solution {
    	    public int lengthOfLastWord(String s) {
    	    	int count = 0, ans = 0;
    	    	int cur = 0;
    	    	for (; cur < s.length(); cur++) {
    	    		count = (s.charAt(cur) == ' ') ?

    0 : count+1; ans = count > 0 ?

    count : ans; } return ans; } }



    版权声明:本文博主原创文章,博客,未经同意不得转载。

  • 相关阅读:
    算法提高 道路和航路
    奇偶剪枝
    二分求值
    并查集--路径压缩
    Oracle数据库导入导出DMP文件
    Spring IoC的实现与思考(一)
    sql基础拾遗
    jquery事件函数的使用之focus
    Java动态代理之cglib
    Java se之动态代理
  • 原文地址:https://www.cnblogs.com/blfshiye/p/4823252.html
Copyright © 2020-2023  润新知