我有一个非常长的字符串,看起来类似于此。String.replace()并非取代所有的发生
355,356,357,358,359,360,361,382,363,364,365,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,368,369,313,370,371,372,373,374,375,376,377,378,379,380,381,382,382,382,382,382,382,383,384,385,380,381,382,382,382,382,382,386,387,388,389,380,381,382,382,382,382,382,382,390,391,380,381,382,382,382,382,382,392,393,394,395,396,397,398,399,....
当我尝试使用下面的代码从字符串中删除数字382。
String str = "355,356,357,358,359,360,361,382,363,364,365,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,360,361,363,366,368,369,313,370,371,372,373,374,375,376,377,378,379,380,381,382,382,382,382,382,382,383,384,385,380,381,382,382,382,382,382,386,387,388,389,380,381,382,382,382,382,382,382,390,391,380,381,382,382,382,382,382,392,393,394,395,396,397,398,399,...."
str = str.replace(",382,", ",");
但似乎并非所有的事件都被取代。最初发生3000次以上的字符串在更换后仍有约630次出现。
String.replace()的能力有限吗?如果是这样,是否有可能实现我所需要的方式?
这怎么会发生630次?此外,你会得到两个逗号背靠背。 – Zarwan
我们必须看到这些数据,但我猜测有682个630个实例与其自身相邻。你对这个逗号背对背。我相应地调整了我的答案。 – dave
'replace()'不使用正则表达式;它使用纯文本搜索 – Bohemian