我目前正在使用python进行任务,我需要帮助,而且我需要帮助
编写一个名为longest的函数,它将采用一串空格分隔的单词并返回最长的单词.
例如:
longest("This is Andela") => "Andela"
longest("A") => "A"
Run Code Online (Sandbox Code Playgroud)
这是样本测试
const assert = require("chai").assert;
describe("Module 10 - Algorithyms", () => {
describe("longest('This Is Andela')", () => {
let result = longest("This Is Andela");
it("Should return 'Andela'", () => {
assert.equal(result, 'Andela');
});
});
describe("longest('This')", () => {
let result = longest("This");
it("Should return 'This'", () => {
assert.equal(result, 'This');
});
});
describe("longest(23)", () => {
let result = longest(23);
it("Should return ''", () => {
assert.equal(result, '');
});
});
});
Run Code Online (Sandbox Code Playgroud)
这就是我尝试过的
function longest(str) {
str = "This is Andela";
var words = str.split(' ');
var longest = '';
for (var i = 0; i < words.length; i++) {
if (words[i].length > longest.length) {
longest = words[i];
}
}
return longest;
}
Run Code Online (Sandbox Code Playgroud)
但我的代码似乎只传递了第一个测试用例.请考虑我是javascript的新手,我需要更改以传递其他两个第一个案例
您需要在函数中删除此行:
str = "This is Andela";
Run Code Online (Sandbox Code Playgroud)
你的函数应该是(添加检查str是否是字符串):
function longest(str) {
if(typeof str !== 'string') return '';
var words = str.split(' ');
var longest = '';
for (var i = 0; i < words.length; i++) {
if (words[i].length > longest.length) {
longest = words[i];
}
}
return longest;
}
Run Code Online (Sandbox Code Playgroud)