Java算法篇寻找字符串中最长的重复元素子串

package com.puhui.goosecard.web.utils;
 
// Java program to find the maximum consecutive
// repeating character in given string
class GFG {
 
    // function to find out the maximum repeating
	// character in given string
	static void maxRepeating(String str)
	{
		char[] array = str.toCharArray();
		int count = 1;
		int max = 0;
		char maxChar = 0;
		int maxIndex=0;
		for(int i=1; i<array.length; i++){ // Start from 1 since we want to compare it with the char in index 0
			if(array[i]==array[i-1]){
				count++;
			} else {
				if(count>max){  // Record current run length, is it the maximum?
					max=count;
					maxChar=array[i-1];
					maxIndex=i-1;
				}
				count = 1; // Reset the count
			}
		}
		if(count>max){
			max=count; // This is to account for the last run
			maxChar=array[array.length-1];
			maxIndex=array.length-1;
		}
		System.out.println("Longest run: "+max+", for the character "+maxChar+"and the max char index is:"+maxIndex);
		System.out.println(str.substring(maxIndex-(max-1),maxIndex+1));
 
	}
 
	// Driver code
	public static void main(String args[])
	{
		String str = "ssstrtyweweqqqqqookkpppdddddddsaw";
		maxRepeating(str);
	}
}
 
// This code is contributed by Sudeep Mukherjee

 

  • 0
    点赞
  • 12
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值