blocks|key|5526956|text|看起来你想要这样的东西|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5526957|%5E\d%2B(?:-\d%2B)?(?:,\d%2B(?:-\d%2B)?)%2B$|code-block|syntax|javascript|5526958|%2B将前一个令牌重复一次或多次。|offset|length|style|CODE|5526959|或|BOLD|5526960|%5E\d%2B(?:-\d%2B)?(?:,\d%2B(?:-\d%2B)?)*$|5526961|*将前一个令牌重复0次或多次。|5526962|DEMO|5526963|entityMap|0|LINK|mutability|MUTABLE|url|https://regex101.com/r/uC2mR5/1^0|0|0|0|1|0|0|1|0|0|0|1|0|0|4|0|0^^$0|@$1|2|3|4|5|6|7|13|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|14|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|15|8|@$I|16|J|17|K|L]]|9|@]|A|$]]|$1|M|3|N|5|6|7|18|8|@$I|19|J|1A|K|O]]|9|@]|A|$]]|$1|P|3|Q|5|D|7|1B|8|@]|9|@]|A|$E|F]]|$1|R|3|S|5|6|7|1C|8|@$I|1D|J|1E|K|L]]|9|@]|A|$]]|$1|T|3|U|5|6|7|1F|8|@]|9|@$I|1G|J|1H|1|1I]]|A|$]]|$1|V|3|-4|5|6|7|1J|8|@]|9|@]|A|$]]]|W|$X|$5|Y|Z|10|A|$11|12]]]]

Seems like you want something like this,

<pre><code>^\d+(?:-\d+)?(?:,\d+(?:-\d+)?)+$
</code></pre>

<code>+</code> repeats the previous token one or more times.

OR

<pre><code>^\d+(?:-\d+)?(?:,\d+(?:-\d+)?)*$
</code></pre>

<code>*</code> repeats the previous token zero or more times.

<a href="https://regex101.com/r/uC2mR5/1" rel="nofollow">DEMO</a>

blocks|key|5526965|text|%5E\d%2B(?:-\d%2B)?(?:,\d%2B(?:-\d%2B)?)*$|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|5526966|试试this.See演示。|unstyled|5526967|https://regex101.com/r/iY3eK8/11|offset|length|5526968|entityMap|0|LINK|mutability|MUTABLE|url^0|0|0|0|W|0|0^^$0|@$1|2|3|4|5|6|7|R|8|@]|9|@]|A|$B|C]]|$1|D|3|E|5|F|7|S|8|@]|9|@]|A|$]]|$1|G|3|H|5|F|7|T|8|@]|9|@$I|U|J|V|1|W]]|A|$]]|$1|K|3|-4|5|F|7|X|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|H]]]]

<pre><code>^\d+(?:-\d+)?(?:,\d+(?:-\d+)?)*$
</code></pre>

Try this.See demo.

<a href="https://regex101.com/r/iY3eK8/11" rel="nofollow">https://regex101.com/r/iY3eK8/11</a>

blocks|key|4058619|text|这不是regex能够很好地解决的问题。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|4058620|你会在其他答案中看到一些部分的解决方案，但除了难以维护外，它们不会处理基本的事情，比如验证页面范围是否有意义。|4058621|使用自定义处理程序会更容易、更灵活：|4058622|4058623|拆分范围|unordered-list-item|4058624|将它们作为单个数字或范围删除pairs|4058625|Optionally，验证范围是否有效(a+<+b)和non-overlapping|4058626|4058627|entityMap^0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|R|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|S|8|@]|9|@]|A|$]]|$1|F|3|-4|5|6|7|T|8|@]|9|@]|A|$]]|$1|G|3|H|5|I|7|U|8|@]|9|@]|A|$]]|$1|J|3|K|5|I|7|V|8|@]|9|@]|A|$]]|$1|L|3|M|5|I|7|W|8|@]|9|@]|A|$]]|$1|N|3|-4|5|6|7|X|8|@]|9|@]|A|$]]|$1|O|3|-4|5|6|7|Y|8|@]|9|@]|A|$]]]|P|$]]

This is not a problem that regex solves very well.

You'll see some partial solutions in other answers, but besides being hard to maintain, they won't take care of basic stuff, like validating that the page ranges make sense.

It's easier and more flexible to use a custom handler that:

<ul>
<li>Splits the ranges</li>
<li>Removes whitespace</li>
<li>Parses them as either single numbers or range pairs</li>
<li>Optionally, verifies that ranges are valid (a &lt; b) and non-overlapping</li>
</ul>

blocks|key|1472808|text|如果需要验证数字的顺序是递增的，并且范围的起始值小于结束值，则可以执行以下操作。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1472809|public+static+bool+ValidPrintRanges(string+ranges)
{
++++int+previousEnd+=+0;
++++foreach+(var+range+in+ranges.Split(','))
++++{
++++++++var+pair+=+range.Split('-');
++++++++int+begin,+end+=+0;
++++++++if+(pair.Length+>+2)
++++++++{
++++++++++++return+false;+//+more+than+one+dash
++++++++}

++++++++//+No+dash,+try+to+parse+and+check+to+previous+end
++++++++if+(pair.Length+==+1)
++++++++{
++++++++++++if+(!int.TryParse(range,+out+end)
++++++++++++++++%7C%7C+previousEnd+>=+end)
++++++++++++{
++++++++++++++++return+false;
++++++++++++}
++++++++}
++++++++//+One+dash,+parse+both+compare+to+each+other+and+to+previous+end
++++++++else+if+(pair.Length+==+2)
++++++++{
++++++++++++if+(!int.TryParse(pair[0],+out+begin)
++++++++++++++++%7C%7C+!int.TryParse(pair[1],+out+end)
++++++++++++++++%7C%7C+previousEnd+>=+begin
++++++++++++++++%7C%7C+begin+>=+end)
++++++++++++{
++++++++++++++++return+false;
++++++++++++}
++++++++}

++++++++previousEnd+=+end;
++++}

++++return+true;
}|code-block|syntax|javascript|1472810|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 you need to verify that the order of the numbers is increasing and that the ranges have a start value less than the end value then you can do the following.

<pre><code>public static bool ValidPrintRanges(string ranges)
{
 int previousEnd = 0;
 foreach (var range in ranges.Split(','))
 {
 var pair = range.Split('-');
 int begin, end = 0;
 if (pair.Length &gt; 2)
 {
 return false; // more than one dash
 }

 // No dash, try to parse and check to previous end
 if (pair.Length == 1)
 {
 if (!int.TryParse(range, out end)
 || previousEnd &gt;= end)
 {
 return false;
 }
 }
 // One dash, parse both compare to each other and to previous end
 else if (pair.Length == 2)
 {
 if (!int.TryParse(pair[0], out begin)
 || !int.TryParse(pair[1], out end)
 || previousEnd &gt;= begin
 || begin &gt;= end)
 {
 return false;
 }
 }

 previousEnd = end;
 }

 return true;
}
</code></pre>

blocks|key|1472819|text|%5E(\d%2B(-\d%2B)?)(,\d%2B(-\d%2B)?)*$|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1472820|​|1472821|📷|atomic|1472822|1472823|注意:您不能使用regexp验证range中的第一个值是否大于第二个值。|1472824|entityMap|0|IMAGE|mutability|IMMUTABLE|imageUrl|https://ask.qcloudimg.com/http-save/yehe-900000/59effb4bbff22f6142619ff3460cce5c.png|imageAlt^0|0|S|0|0|0|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|W|8|@$9|X|A|Y|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|Z|8|@]|D|@]|E|$]]|$1|H|3|I|5|J|7|10|8|@]|D|@$9|11|A|12|1|13]]|E|$]]|$1|K|3|G|5|6|7|14|8|@]|D|@]|E|$]]|$1|L|3|M|5|6|7|15|8|@]|D|@]|E|$]]|$1|N|3|-4|5|6|7|16|8|@]|D|@]|E|$]]]|O|$P|$5|Q|R|S|E|$T|U|V|-4]]]]

<code>^(\d+(-\d+)?)(,\d+(-\d+)?)*$</code>

<img src="https://i.stack.imgur.com/SGyyI.png" alt="Regex">

NOTE: You can not validate whether first value in range is greater then second value using regexp.

i have a text box which takes input for printing.following are acceptable patterns

1,4-5,6,7-9 or 1,2,3,4-5 or 1,2-9,10-15,16.

i tried with the following code but some cases are failing

<pre><code>List&lt;bool&gt; result = new List&lt;bool&gt;();
string[] array = inputstring.Split(',');
int i = 0;
foreach (string k in array)
{ 
 result.Add(Regex.IsMatch(k, @"^\d+|(\d+-\d+)$"));
 i++;
}
foreach (bool b in result)
{
 if (b.Equals(false))
 {
 MessageBox.Show("Please enter valid entry for print pages");
 return;
 }
} 
</code></pre>

Thanks in advance

C# regex for 1,4-5,6,7-9 or 1,2,3,4-5 or 1,2-9,10-15,16

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

我有一个文本框，接受printing.following的输入是可接受的模式1,4-5,6,7-9或1,2,3,4-5或1,2-9,10-15,16。我尝试使用以下代码，但某些情况下失败List<bool> result = new List<bool>();string[] array = inputstring.Split(',');int i = 0;foreach (string k in

问1,4-5,6,7-9或1,2,3,4-5或1,2-9,10-15,16的C#正则表达式
EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问1,4-5,6,7-9或1,2,3,4-5或1,2-9,10-15,16的C#正则表达式EN

回答 5

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问1,4-5,6,7-9或1,2,3,4-5或1,2-9,10-15,16的C#正则表达式
EN