【发布时间】:2022-01-06 05:06:02
【问题描述】:
给定一个在 ascii[a-z] 范围内的正方形网格,按字母顺序重新排列每行的元素,升序。确定列是否也按字母升序排列,从上到下。如果是则返回 YES,否则返回 NO。
const gridOrig = ["ebacd", "fghij", "olmkn", "trpqs", "xywuv"];
function gridChallenge(grid) {
// Write your code here
let gridOne = [];
let gridTwo = [];
for (let i = 0; i < grid.length; i++) {
gridOne.push(grid[i].split(""));
// console.log(gridOne);
}//this section makes each element of the array become array
for (let i = 0; i < gridOne.length; i++) {
gridTwo.push(gridOne[i].sort());
// console.log(gridTwo);
}//this section sort each element of the parent array
let answer = [];
for (let i = 0; i < gridTwo.length - 1; i++) {
for (let j = 0; j < gridTwo[i].length; j++) {
if (gridTwo[i][j] <= gridTwo[i + 1][j]) {
// debugger;
// console.log("true");
answer.push("YES");
} else if (undefined) {
answer = "NO";
} else {
// console.log("false");
answer.push("NO");
}
}
}
// console.log(answer);
let finalAns = "NO";
if (answer.includes("NO")) {
finalAns = "NO";
} else {
finalAns = "YES";
}
console.log(finalAns); //I can see it on the console
return finalAns; // this returns nothing
}
gridChallenge(gridOrig);
【问题讨论】:
标签: javascript return return-value