如何解决如何提取数组中相同字符的最大序列?
----------
这样每个座位都离另一个座位最远
-----X---
和下一个
--X--X---
依此类推
这是我目前的代码:
public static void occupyOneMore(char[] anArray) {
//initialize and declare variables
int longestStart = 0;
int longestSeats = 0;
int currentSeats = 1;
int currentStart = 0;
char emptySeat = '-';
//scan every element
for (int index=1; index < anArray.length ; index++) {
System.out.print(" index " + index);
//System.out.print(" checking - index is " + index);
if (anArray[index] == emptySeat && anArray[index] == anArray[index-1]) {
currentSeats ++;
}
// currentStart = index - currentSeats;
else if (currentSeats > longestSeats){
longestSeats = currentSeats;
longestStart = currentStart;
System.out.println("Else statement");
}
//System.out.print( " current seats - " + currentSeats);
}
System.out.println(longestSeats);
System.out.println(longestStart);
int mid = (longestStart + (longestSeats+longestStart)) / 2;
anArray[mid] = 'X';
System.out.print(anArray);
}
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。