Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Scanner;
- public class MinDist {
- public static void main(String[] udq) {
- Scanner gdP = new Scanner(System.in);
- String ot9 = gdP.nextLine();
- char guZ = gdP.next().charAt(0), zpW = gdP.next().charAt(0);
- int ugK, xtW = -1, xo8, lja = 2147483647;
- for (ugK = ot9.length() - 1; ugK >= 0; ugK--) {
- if (ot9.charAt(ugK) == guZ) {
- if (xtW != -1)lja = Math.min(lja, xtW - ugK - 1);
- for (xo8 = ugK - 1; xo8 >= 0; xo8--) {
- if (ot9.charAt(xo8) == guZ) {
- xo8++;
- break;
- } else if (ot9.charAt(xo8) == zpW) {
- xtW = xo8;
- lja = Math.min(lja, ugK - xtW - 1);
- break;
- }
- }ugK = xo8;
- } else if (ot9.charAt(ugK) == zpW)xtW = ugK;
- }
- System.out.println(lja);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement