Leetcode 193.Valid Phone Numbers

https://leetcode.com/problems/valid-phone-numbers/description/
Shell脚本题目：给file.txt ，输出复合格式的电话号码。思路是使用正则，但是有几个坑。

注意grep -E 与grep -P 的区别 https://www.jianshu.com/p/e1acfb7989b2
-E 其实是扩展支持| 与& 这种方式，-P才是Perl正则
注意正则使用^ 和 $ 包围精确匹配
刚开始使用cat 和read 读取文件，发现要么多个空格省略成一个，要么修改IFS为‘‘ 但是又处理不了换行。https://stackoverflow.com/questions/7314044/use-bash-to-read-line-by-line-and-keep-space
实际上grep 直接读取文件就好了。

grep -P "^(\d{3}-|\(\d{3}\) )\d{3}-\d{4}$" file.txt

原文地址：http://blog.51cto.com/ryanscn/2134367

时间： 2024-10-08 00:00:14

Leetcode 193.Valid Phone Numbers的相关文章

LeetCode（193. Valid Phone Numbers）(sed用法)

193. Valid Phone Numbers 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 f

193. Valid Phone Numbers

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

[LeetCode] Valid Phone Numbers 验证电话号码

[LeetCode] Valid Phone Numbers

leetcode -day13 Valid Palindrome & Triangle & Pascal's Triangle I II

1. Valid Palindrome Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, "A man, a plan, a canal: Panama" is a palindrome. "race a car" is not a palindrome. Note:

LeetCode --- 2. Add Two Numbers

题目链接: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 the two numbers and return it as a linked list. Input: (2 -> 4 -> 3

【LeetCode】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 the two numbers and return it as a linked list. Input: (2 -> 4 -> 3) + (5 -> 6 ->

LeetCode：Valid Parentheses - 合理的括号搭配

1.题目名称 Valid Parentheses(合理的括号搭配) 2.题目地址 https://leetcode.com/problems/valid-parentheses/ 3.题目内容英文:Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the

LeetCode --- 65. Valid Number

题目链接:Valid Number Validate if a given string is numeric. Some examples: "0" => true " 0.1 " => true "abc" => false "1 a" => false "2e10" => true Note: It is intended for the problem statemen