Solution: Help the Police Officers Catch the Thieves

class MaxThief {
 public static int policeThief(char[] policeThiefArray, int n, int k) {
  int result = 0;
  boolean[] caught = new boolean[n];
  for (int i = 0; i < n; i++) {
   caught[i] = false;
  }
  for (int i = 0; i < n; i++) {
   //check k steps forward
   if (policeThiefArray[i] == 'P' && caught[i] == false) {
    for (int j = i; j < (j + k) && j < n ; j++) {
     if (policeThiefArray[j] == 'T' && caught[j] == false) {
      caught[i] = true;
      caught[j] = true;
      result++;
      break;
     }
    }
   }
   //check k steps backward  
   if (policeThiefArray[i] == 'P' && caught[i] == false) {
    for (int j = i; j > (j - k) && j > -1 ; j--) {
     if (policeThiefArray[j] == 'T' && caught[j] == false) {
      caught[i] = true;
      caught[j] = true;
      result++;
      break;
     }
    }
   }
  }
  return result;
 }
}
class Main{
  public static void main(String[] args) {
  int k, n;
  char policeTheifArray[] = {'P', 'T', 'T', 'P', 'T'};
  k = 2;
  n = policeTheifArray.length;
  System.out.println("Maximum thieves caught for {P, T, T, P, T}: " + MaxThief.policeThief(policeTheifArray, n, k)); 
  char policeTheifArray1[] = {'T', 'T', 'P', 'P', 'T', 'P'};
  k = 2;
  n = policeTheifArray1.length;
  System.out.println("Maximum thieves caught for {T, T, P, P, T,P}: " + MaxThief.policeThief(policeTheifArray1, n, k)); 
}
}