Length of Last Word

最新推荐文章于 2021-05-08 15:12:01 发布
最新推荐文章于 2021-05-08 15:12:01 发布
阅读量455 收藏
点赞数
分类专栏： 算法数据结构
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/okiwilldoit/article/details/18504517
版权

很简单，按“ ”分割就可以了，Java中有s.split()函数

public int lengthOfLastWord(String s) {
        String[] strArray = s.split(" ");
        if(strArray.length == 0)return 0;
        return strArray[strArray.length-1].length();
    }

okiwilldoit
关注
专栏目录
[LeetCode]--58. Length of Last Word
杜鲁门的博客
10-03 592
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
leetcode 58 Length of Last Word C++
wcxdell的专栏
06-08 753
注意特殊情况。 int lengthOfLastWord(string s) { if(s.empty()) return 0; int right = s.size(); int left = right; while(left>0) { if(s[left-1]!=' ')
LeetCode刷题（C++）——Length of Last Word（Easy）
YF_Li123的博客
05-14 423
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
LeetCode 58 — Length of Last Word（C++ Java Python）
龙之梦
02-24 3613
题目：http://oj.leetcode.com/problems/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.
Leetcode_length-of-last-word (updated c++ and python version)
x
03-25 878
地址：http://oj.leetcode.com/problems/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 th
【leetcode】58. Length of Last Word（Python & C++）
I am what i am
09-06 822
58. Length of Last Word题目链接88.1 题目描述：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
58. Length of Last Word
u013260370的博客
08-29 150
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 defin...
leetcode题记：Length of Last Word
s37
07-17 233
编程语言：JAVA 题目描述： 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. N...
LeetCode刷题之58 Length of Last Word
圆师傅的博客
05-08 278
文章目录1.Description2. Test Cases3. Solution3.13.2 1.Description Given a string s consists of some words separated by spaces, return the length of the last word in the string. If the last word does not exist, return 0. A word is a maximal substring consisting
(LeetCode)Length of Last Word --- 最后一个单词的长度
杨鑫newlife的专栏
10-28 892
(LeetCode)Length of Last Word --- 最后一个单词的长度
Leetcode58. Length of Last Word--求最后一个单词的长度（单词有非空格字符组成）
Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发
06-20 204
Given a stringsconsists 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 defin...
LeetCode Length of Last Word
易水寒
03-17 1304
1. 题目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 defi
LeetCode 58. Length of Last Word
柳婼 の blog
07-22 1181
58. Length of Last Word My Submissions QuestionEditorial Solution Total Accepted: 90032 Total Submissions: 308380 Difficulty: Easy Given a string s consists of upper/lower-case alphabets and empty
leetcode:字符串之Length of Last Word
what_lei的博客
08-11 691
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
南京工业大学在辽宁2020-2024各专业最低录取分数及位次表.pdf
10-04
那些年，与你同分同位次的同学都去了哪里？全国各大学在辽宁2020-2024年各专业最低录取分数及录取位次数据，高考志愿必备参考数据
下单系统的Spnigboot和微信小程序实现（全栈微信小程式下单）.zip
10-04
下单系统的Spnigboot和微信小程序实现（全栈微信小程式下单）
基于Java开发的智能文件管家设计源码
最新发布
10-04
该项目是一款基于Java的智能文件管家设计源码，涵盖102个文件，包括29个Java源文件、27个类文件、19个XML配置文件、10个YAML文件、8个列表文件、4个属性文件、4个JAR包文件以及1个Git忽略文件。该系统旨在提供高效便捷的文件管理解决方案。
基于YoloV8的简单目标检测和跟踪，使用KMNET进行鼠标移动（处理多目标移动抖动，处理鼠标平滑移动）.zip
10-04
基于YoloV8的简单目标检测和跟踪，使用KMNET进行鼠标移动（处理多目标移动抖动，处理鼠标平滑移动）
用c++解决下述问题：描述 Some words have power. It can make a string containing it become more powerful (larger weight). The weight of a word in a string is defined as the number of its occurences in the string multiplied by its value, while the weight of the string is defined as the sum of all words' weights. Given some words with their values, you should output the string consisting of these words which make the string's weight maximal. 输入 The input consists of multiple test cases. The first line of the input is an integer T, indicating the number of the test cases. Each test case starts with a line consisting of two integers: N and M, indicating the string's maximum length and the number of the words. Each of the following M lines consists of a word Wi. The last line of each test case consists of M integers, while the i-th number indicates the value Vi of Wi. Technical Specification: 1. T ≤ 15 2. 0 < N ≤ 50, 0 < M ≤ 100. 3. The length of each word is less than 11 and bigger than 0. 4. 1 ≤ Vi ≤ 100. 5. All the words in the input are different. 6. All the words just consist of 'a' - 'z'. 输出 For each test case, output the string which has the maximal weight in a single line.If there are multiple answers, output the shortest one. If there are still multiple answers, output the smallest one in lexicographical order. The answer may be an empty string.
06-09
这道题需要使用动态规划来解决。我们可以定义dp[i]表示长度为i的字符串的最大权值，它可以通过枚举最后一个单词得到。具体地，我们枚举最后一个单词为Wi，那么dp[i]就可以由dp[i-len(Wi)] + Vi得到，其中len(Wi)表示...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值