[LeetCode 193] Valid Phone Numbers

문제 바로가기

Description

---

Given a text file file.txt that contains a list of phone numbers (one per line), write a one-liner bash script to print all valid phone numbers.

You may assume that a valid phone number must appear in one of the following two formats: (xxx) xxx-xxxx or xxx-xxx-xxxx. (x means a digit)

You may also assume each line in the text file must not contain leading or trailing white spaces.

Example:

Assume that file.txt has the following content:

987-123-4567
123 456 7890
(123) 456-7890

Your script should output the following valid phone numbers:

987-123-4567
(123) 456-7890

Code

---

내 제출

---

# Read from the file file.txt and output all valid phone numbers to stdout.

awk '/^([0-9]{3}-|\([0-9]{3}\) )[0-9]{3}-[0-9]{4}$/' file.txt

Runtime	Memory
68 ms	3.9 MB

다른 풀이

---

# Read from the file file.txt and output all valid phone numbers to stdout.

grep -E "^([0-9]{3}-|\\([0-9]{3}\\) )[0-9]{3}-[0-9]{4}$" file.txt

Reference

---

• https://github.com/doocs/leetcode/blob/main/solution/0100-0199/0193.Valid%20Phone%20Numbers/Solution.sh