瀏覽代碼

Latest May problem

master
Lachlan Jacob 5 年之前
父節點
當前提交
5919015b37
共有 3 個文件被更改,包括 34 次插入0 次删除
  1. 20
    0
      problems/383/main.js
  2. 11
    0
      problems/383/problem.txt
  3. 3
    0
      problems/383/run.sh

+ 20
- 0
problems/383/main.js 查看文件

@@ -0,0 +1,20 @@
/**
* @param {string} ransomNote
* @param {string} magazine
* @return {boolean}
*/
var canConstruct = function(ransomNote, magazine) {
let mag = Array.from(magazine);
for (const i in ransomNote) {
let ind = mag.indexOf(ransomNote[i]);
if (ind > -1) {
mag.splice(ind, 1);
} else {
return false;
}
}
return true;
};

console.log("Expected: true");
console.log(`Got: ${canConstruct("aa", "aba")}`);

+ 11
- 0
problems/383/problem.txt 查看文件

@@ -0,0 +1,11 @@
Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false.

Each letter in the magazine string can only be used once in your ransom note.

Note:
You may assume that both strings contain only lowercase letters.

canConstruct("a", "b") -> false
canConstruct("aa", "ab") -> false
canConstruct("aa", "aab") -> true


+ 3
- 0
problems/383/run.sh 查看文件

@@ -0,0 +1,3 @@
#!/bin/bash

node main.js

Loading…
取消
儲存