栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

如何在整数数组中查找整数的重复序列?

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

如何在整数数组中查找整数的重复序列?

@MiljenMikic的答案很好,尤其是因为语法实际上不是常规的。:D

如果您想一般地在一个数组上进行操作,或者想了解它,那么可以做到正则表达式几乎完全可以做到:

public static void main(String[] args) {    int[] arr = {0, 1, 2, 3, 2, 3}; // 2, 3 repeats at position 2.    // for every position in the array:    for (int startPos = 0; startPos < arr.length; startPos++) {        // check if there is a repeating sequence here:        // check every sequence length which is lower or equal to half the        // remaining array length: (this is important, otherwise we'll go out of bounds)        for (int sequenceLength = 1; sequenceLength <= (arr.length - startPos) / 2; sequenceLength++) { // check if the sequences of length sequenceLength which start // at startPos and (startPos + sequenceLength (the one // immediately following it)) are equal: boolean sequencesAreEqual = true; for (int i = 0; i < sequenceLength; i++) {     if (arr[startPos + i] != arr[startPos + sequenceLength + i]) {         sequencesAreEqual = false;         break;     } } if (sequencesAreEqual) {     System.out.println("Found repeating sequence at pos " + startPos); }        }    }}


转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/595156.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号