数据结构与算法
双指针、回溯剪枝、图论与搜索
🎨 视觉封面LeetCode Valid Phone Number
Problem
Given a text file file.txt that contains 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.
For 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
即从文件中找到合法的电话号码。又进入bash题区了。
Bash
grep -P '^(\d{3}-|\(\d{3}\) )\d{3}-\d{4}
分析
没啥可说的,正则题而已。唯一需要注意的是,这里用的是\d ,所以需要-P支持。
file.txt
分析
没啥可说的,正则题而已。唯一需要注意的是,这里用的是\d ,所以需要-P支持。
所有代码开源上传至 GitHub:yummy-code 仓库 · GESP 专题站:GESP WIKI
欢迎加入:C++ GESP/CSP 考级答疑群(688906745) 与 Java/Python交流群(982860385),点击可直接加群。
猜你想读 · 相关文章推荐
LeetCode Tenth Line
Problem How would you print just the 10th line of a file? For example, assume that file.txt has the following content: Your script should output the tenth line,...
LeetCode[Algorithms] Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add...
LeetCode[Algorithms] Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcb...
OneCoder (lihongzheshuai)
一个中年人的自留地,记录学习 C++、GESP/NOI、Java、Python 与算法架构的心得体会。本站唯一网址:coderli.com