Build a version of the Unix tr -d command. Given a list of lines and a string chars, remove every character that appears in chars from each line, then return the lines joined by newline characters (\n).
Notes: chars is a non-empty ASCII string whose characters are taken literally (no ranges). Upper and lower case are different characters. A line can become empty after deleting, and then it stays as an empty line in the output.
Function signature:
fun trDelete(lines: List<String>, chars: String): String
Example:
Input: lines = ["banana", "apple"], chars = "aeiou" Output: "bnn\nppl" When printed: bnn ppl
Put each character of
chars into a HashSet<Char> for O(1) lookup. Walk every line and append characters that are NOT in the set.
The full solution:
class Solution {
fun trDelete(lines: List<String>, chars: String): String {
val set = HashSet<Char>()
for (i in 0 until chars.length) {
set.add(chars[i])
}
val result = ArrayList<String>()
for (line in lines) {
val sb = StringBuilder()
for (j in 0 until line.length) {
val ch = line[j]
if (!set.contains(ch)) {
sb.append(ch)
}
}
result.add(sb.toString())
}
return result.joinToString("\n")
}
}
Free plan: 30 tutor messages. Premium is unlimited.
Saved
Ctrl + Enter to check
