Leetcode-problems/problem994.java at main · tejatayi/Leetcode-problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
// 994. Rotting Oranges

import java.util.LinkedList;
import java.util.Queue;

public class problem994 {

     public static int orangesRotting(int[][] grid) {
        Queue<Integer> qi = new LinkedList<>();
        Queue<Integer> qj = new LinkedList<>();
        int total=0;
        int time =0;
        int r = grid.length;
        int c = grid[0].length;
        for(int i =0; i< r; i++)
        {
            for(int j=0 ; j<c ; j++ )
            {
                if(grid[i][j] ==1)
                {
                    total++;
                }
                if(grid[i][j]==2)
                {
                    qi.add(i);
                    qj.add(j);
                }
            }
        }

        while(!qi.isEmpty() && total>0)
        {
            time++;
            int siz=qi.size();

            for(int i=0;i<siz;i++)
            {
                int ti = qi.poll();
                int tj= qj.poll();

                if(ti>0 && grid[ti-1][tj]==1 )
                {
                    grid[ti-1][tj]=2;
                    qi.add(ti-1);
                    qj.add(tj);
                    total--;
                }
                 if(ti+1<r && grid[ti+1][tj]==1)
                {
                    grid[ti+1][tj]=2;
                    qi.add(ti+1);
                    qj.add(tj);
                    total--;
                }
                 if(tj>0 && grid[ti][tj-1]==1)
                {
                    grid[ti][tj-1]=2;
                    qi.add(ti);
                    qj.add(tj-1);
                    total--;
                }
                 if(tj+1<c && grid[ti][tj+1]==1)
                {
                    grid[ti][tj+1]=2;
                    qi.add(ti);
                    qj.add(tj+1);
                    total--;
                }
            }
        }

        return (total>0) ? -1 : time;
    }


    public static void main(String[] args) {

        int [][] a = {{2,1,1},{1,1,1},{0,1,2}};

        System.out.println(orangesRotting(a));

    }

}