blocks|key|2512785|text|这应该是一项工作：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2512786|([4-9][0-9]%7C\d{3,})\.|code-block|syntax|javascript|2512787|在这里查看：http://www.regexr.com/3a5v9|offset|length|2512788|entityMap|0|LINK|mutability|MUTABLE|url|http://www.regexr.com/3a5v9^0|0|0|6|R|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|T|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|U|8|@]|9|@$I|V|J|W|1|X]]|A|$]]|$1|K|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]]]

This should do the job:

<pre><code>([4-9][0-9]|\d{3,})\.
</code></pre>

Check it here:
<a href="http://www.regexr.com/3a5v9">http://www.regexr.com/3a5v9</a>

blocks|key|4173372|text|不要使用正则表达式进行数字比较。例如，如果您使用Javascript：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4173373|var+aNumber+=+parseFloat("50");
if+(aNumber+>+40)+{
++++//+yay!
}|code-block|syntax|javascript|4173374|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

Don't use regular expressions for number comparison. If, for example, you're using Javascript:

<pre><code>var aNumber = parseFloat("50");
if (aNumber &gt; 40) {
 // yay!
}
</code></pre>

blocks|key|179720|text|可以使用括号表示要匹配的最小字符数(如果需要)。所以,|type|unstyled|depth|inlineStyleRanges|entityRanges|data|179721|([4-9][0-9]%7C[1-9][0-9]{2,})\.|code-block|syntax|javascript|179722|匹配4-9，后面跟着一个或多个数字。大概在开始的时候有一个边界，但是听起来你已经解决了这个问题。这使用OR来允许两组可能的第一位数。|179723|entityMap^0|0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|M|8|@]|9|@]|A|$]]|$1|I|3|-4|5|6|7|N|8|@]|9|@]|A|$]]]|J|$]]

You can use brackets to indicate a minimum and, if desired, maximum number of characters to match. So,

<pre><code>([4-9][0-9]|[1-9][0-9]{2,})\.
</code></pre>

matches 4-9 followed by one or more digits. Presumably there's a boundary of some sort at the beginning of this, but it sounds like you have that part worked out. This uses an OR to allow for two possible groups of first digits.

blocks|key|2512735|text|(40\.(?!0[%5E\d]%7C00)\d{1,2}%7C(((4[1-9](?!\d)%7C[5-9][0-9])(?![\d])%7C\d*[1-9]\d{2,})(\.\d{1,2})?))|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|2512736|这可以防止误报导致0。|unstyled|2512737|这对我有用。|2512738|它试图匹配40后面的1或2个小数位数，而不是00。|unordered-list-item|2512739|然后，它尝试匹配4，后面是1-9，小数可选。|2512740|如果它不能匹配它匹配5-9和0-9，小数点可选。|2512741|然后，它尝试匹配任何数字，任意次数，后面是1-9，后面是1或2位数字，十进制可选。|2512742|2512743|2512744|如果您想要求十进制，只需删除最后一个问号。|2512745|entityMap^0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|A|$]]|$1|G|3|H|5|F|7|Z|8|@]|9|@]|A|$]]|$1|I|3|J|5|K|7|10|8|@]|9|@]|A|$]]|$1|L|3|M|5|K|7|11|8|@]|9|@]|A|$]]|$1|N|3|O|5|K|7|12|8|@]|9|@]|A|$]]|$1|P|3|Q|5|K|7|13|8|@]|9|@]|A|$]]|$1|R|3|-4|5|F|7|14|8|@]|9|@]|A|$]]|$1|S|3|-4|5|F|7|15|8|@]|9|@]|A|$]]|$1|T|3|U|5|F|7|16|8|@]|9|@]|A|$]]|$1|V|3|-4|5|F|7|17|8|@]|9|@]|A|$]]]|W|$]]

<pre><code>(40\.(?!0[^\d]|00)\d{1,2}|(((4[1-9](?!\d)|[5-9][0-9])(?![\d])|\d*[1-9]\d{2,})(\.\d{1,2})?))
</code></pre>

This prevents false positives from leading 0s.

This worked for me.

<ul>
<li>It tries to match 40 followed by 1 or two decimals that are not 00.</li>
<li>It then tries to match 4 followed by 1-9, decimal optional.</li>
<li>If it can't match that it matches 5-9 followed by 0-9, decimal optional.</li>
<li>It then triese to match any digit, any number of times, followed by 1-9, followed by 1 or 2 digits, decimal optional.</li>
</ul>

If you want to require the decimal, just remove the last question mark.

blocks|key|2512769|text|这样可以做到：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2512770|([4-9][0-9]%2B%7C\d{3,})|code-block|syntax|javascript|2512771|这将得到第一个大于4的两位数的所有数字，或者任何三位数的数字。|2512772|以http://www.regexr.com/3a5v0为例|offset|length|2512773|entityMap|0|LINK|mutability|MUTABLE|url|http://www.regexr.com/3a5v0^0|0|0|0|1|R|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|V|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|W|8|@]|9|@]|A|$]]|$1|I|3|J|5|6|7|X|8|@]|9|@$K|Y|L|Z|1|10]]|A|$]]|$1|M|3|-4|5|6|7|11|8|@]|9|@]|A|$]]]|N|$O|$5|P|Q|R|A|$S|T]]]]

This will do it: 

<pre><code>([4-9][0-9]+|\d{3,})
</code></pre>

This it will get all the numbers of two digits having the first one greater than 4 or any number with three digits. 

As an example <a href="http://www.regexr.com/3a5v0" rel="nofollow">http://www.regexr.com/3a5v0</a>

blocks|key|4173563|text|如果您的regex风味可以使用负查找以匹配41到9999之间的数字，而不使用十进制：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4173564|\b(?:[1-9][0-9]{2,3}%7C[5-9][0-9]%7C4[1-9])(?<!\.\d{1,2})\b|code-block|syntax|javascript|4173565|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

If your regex flavour can use negative lookbehind to match the numbers from 41 to 9999 without decimal:

<pre><code>\b(?:[1-9][0-9]{2,3}|[5-9][0-9]|4[1-9])(?&lt;!\.\d{1,2})\b
</code></pre>

blocks|key|4173616|text|(其他大多数答案对我来说都是完美的--这是个偏执狂，也是个坏主意:)|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4173617|对于grep+-Po或Perl，我们可以使用：|offset|length|style|CODE|4173618|'\b(\d{3,}%7C[4-9]\d)\.\d\d'|code-block|syntax|javascript|4173619|但这将得到40.00+(不超过40)|4173620|'\b(\d{3,}%7C[5-9]\d%7C4[1-9])\.\d\d%7C\b40\.\d?[1-9]\d?'|4173621|对应于：|4173622|+++++DDD.DD+
%7C+[5-9]D.DD
%7C+4[1-9].DD+
%7C+++++40.D[1-9]+
%7C+++++40.[1-9]D|4173623|entityMap^0|0|2|8|B|4|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|X|8|@$D|Y|E|Z|F|G]|$D|10|E|11|F|G]]|9|@]|A|$]]|$1|H|3|I|5|J|7|12|8|@]|9|@]|A|$K|L]]|$1|M|3|N|5|6|7|13|8|@]|9|@]|A|$]]|$1|O|3|P|5|J|7|14|8|@]|9|@]|A|$K|L]]|$1|Q|3|R|5|6|7|15|8|@]|9|@]|A|$]]|$1|S|3|T|5|J|7|16|8|@]|9|@]|A|$K|L]]|$1|U|3|-4|5|6|7|17|8|@]|9|@]|A|$]]]|V|$]]

(Most of the other answer are perfect for me -- This is paranoia and a bad idea :) 

for use with <code>grep -Po</code> or <code>Perl</code> we could use:

<pre><code>'\b(\d{3,}|[4-9]\d)\.\d\d'
</code></pre>

but this would get 40.00 (not greater than 40)

<pre><code>'\b(\d{3,}|[5-9]\d|4[1-9])\.\d\d|\b40\.\d?[1-9]\d?'
</code></pre>

Corresponding to:

<pre><code> DDD.DD 
| [5-9]D.DD
| 4[1-9].DD 
| 40.D[1-9] 
| 40.[1-9]D
</code></pre>

blocks|key|4173656|text|在flex(1)中，您可以使用以下代码来解析字符串并获得大于40的数字：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4173657|pru.l：|4173658|%25option+noyywrap
%25%25
\%2B?(0*[4-9][0-9]%7C0*[1-9][0-9][0-9][0-9]*)(\.[0-9]*)?++{+printf("Greater+than+40:+%25s\n",+yytext);+}
\-?[0-9]*(\.[0-9]*)?++++++++++++++++++++++++++++++++{+printf("Lesser+than+40:+%25s\n",+yytext);+}
\n++++++++++++++++++++++++++++++++++++++++++++++++%7C
.+++++++++++++++++++++++++++++++++++++++++++++++++;
%25%25

int+main()
{+yylex();+}|code-block|syntax|javascript|4173659|安装flex并用|offset|length|style|BOLD|4173660|make+pru|4173661|然后将其运行为：|4173662|pru+<filein+>fileout|4173663|或者只是|4173664|pru|4173665|此代码从列出的正则表达式构造确定性有限自动机，并在识别大于40的值时打印右边列出的命令。它允许前导可选符号和前导零，以及由任意数量的数字组成的可选小数部分。它只对每一个字符进行一次分配和一个决定。您可以访问flex生成的自动机状态表(它为您编写C代码)|4173666|识别大于40的数字(包含小数、先导符号和零)的正则表达式是：|4173667|\%2B?(0*[4-9][0-9]%7C0*[1-9][0-9][0-9][0-9]*)(\.[0-9]*)?|4173668|可作为以下几个方面加以削弱：|4173669|\%2B?(0*[4-9][0-9]%7C0*[1-9][0-9]{3,})(\.[0-9]*)?|4173670|说明：|4173671|%2B?匹配一个可选的加号。|unordered-list-item|4173672|(...%7C...)有两种选择：|4173673|*可选的任意数目的铅零。|4173674|4-9数字40至99|4173675|1-9{3+}数字100及以上。|4173676|(.0-9*)可选小数点后面跟着任意数目的数字。|4173677|4173678|4173679|entityMap^0|0|0|0|2|4|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|1R|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|1S|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|1T|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|1U|8|@$K|1V|L|1W|M|N]]|9|@]|A|$]]|$1|O|3|P|5|F|7|1X|8|@]|9|@]|A|$G|H]]|$1|Q|3|R|5|6|7|1Y|8|@]|9|@]|A|$]]|$1|S|3|T|5|F|7|1Z|8|@]|9|@]|A|$G|H]]|$1|U|3|V|5|6|7|20|8|@]|9|@]|A|$]]|$1|W|3|X|5|F|7|21|8|@]|9|@]|A|$G|H]]|$1|Y|3|Z|5|6|7|22|8|@]|9|@]|A|$]]|$1|10|3|11|5|6|7|23|8|@]|9|@]|A|$]]|$1|12|3|13|5|F|7|24|8|@]|9|@]|A|$G|H]]|$1|14|3|15|5|6|7|25|8|@]|9|@]|A|$]]|$1|16|3|17|5|F|7|26|8|@]|9|@]|A|$G|H]]|$1|18|3|19|5|6|7|27|8|@]|9|@]|A|$]]|$1|1A|3|1B|5|1C|7|28|8|@]|9|@]|A|$]]|$1|1D|3|1E|5|1C|7|29|8|@]|9|@]|A|$]]|$1|1F|3|1G|5|1C|7|2A|8|@]|9|@]|A|$]]|$1|1H|3|1I|5|1C|7|2B|8|@]|9|@]|A|$]]|$1|1J|3|1K|5|1C|7|2C|8|@]|9|@]|A|$]]|$1|1L|3|1M|5|1C|7|2D|8|@]|9|@]|A|$]]|$1|1N|3|-4|5|6|7|2E|8|@]|9|@]|A|$]]|$1|1O|3|-4|5|6|7|2F|8|@]|9|@]|A|$]]|$1|1P|3|-4|5|6|7|2G|8|@]|9|@]|A|$]]]|1Q|$]]

In flex(1) you have this code to parse strings and get numbers greater than 40:
<h1>pru.l:</h1>
<pre><code>%option noyywrap
%%
\+?(0*[4-9][0-9]|0*[1-9][0-9][0-9][0-9]*)(\.[0-9]*)? { printf(&quot;Greater than 40: %s\n&quot;, yytext); }
\-?[0-9]*(\.[0-9]*)? { printf(&quot;Lesser than 40: %s\n&quot;, yytext); }
\n |
. ;
%%

int main()
{ yylex(); }
</code></pre>
Install flex and compile this file it with
<pre><code>make pru
</code></pre>
Then run it as:
<pre><code>pru &lt;filein &gt;fileout
</code></pre>
or just
<pre><code>pru
</code></pre>
This code constructs a deterministic finite automaton from the regular expressions listed and prints the commands listed on the right when recognizes a value greater than 40. It allows a leading optional sign and leading zeros, and an optional fractional part composed of any number of digits. And it does this with only one asignment and one decision for each character read. You have access to the automaton state table generated by flex (it writes C code for you)
the regex that recognizes numbers greater than 40 (with decimals and leading sign and zeros) is:
<pre><code>\+?(0*[4-9][0-9]|0*[1-9][0-9][0-9][0-9]*)(\.[0-9]*)?
</code></pre>
and can be abreviated as:
<pre><code>\+?(0*[4-9][0-9]|0*[1-9][0-9]{3,})(\.[0-9]*)?
</code></pre>
explanation:
<ul>
<li>\+? matches an optional plus sign.</li>
<li>(...|...) two options:</li>
<li>0* optional arbitrary number of leadin zeros.</li>
<li>[4-9][0-9] the numbers 40 to 99</li>
<li>[1-9][0-9]{3,} the numbers 100 and up.</li>
<li>(.[0-9]*)? optional decimal point followed by an arbitrary number of digits.</li>
</ul>

I'm trying to match numbers greater than 40. The good point is that all of them have 2 decimal places, so all of them are like: 3.25, 5.89, 999.75 and they don't use any leading zeros (except on the decimal part that always have 2 digits)...
At first I tried the following code but then I realized this wouldn't match numbers like 100, 1000... even if they are greater than 40.

<pre><code>[4-9][0-9]\.
</code></pre>

I don't have to match the decimal part, so don't worry about matching that, just help me to find how to match numbers greater than 40 (up to 9999 would be fine).

Thanks for your help.

Matching numbers greater than 40

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我在试着匹配大于40的数字。好的一点是，它们都有两个小数位，所以它们都是: 3.25，5.89,999.75，并且它们不使用任何前导零(小数点部分总是有2位数字的小数部分除外).一开始我尝试了下面的代码，但后来我意识到这与100,1000这样的数字不匹配.即使它们大于40。[4-9][0-9]\.我不需要匹配十进制部分，所以不要担心匹配，只需帮助我找到如何匹配大于40的数字(高达9999就可以了)

问匹配数大于40
EN

回答 8

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问匹配数大于40EN

回答 8

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问匹配数大于40
EN