994. Rotting Oranges

In a given grid, each cell can have one of three values:
the value 0 representing an empty cell;
the value 1 representing a fresh orange;
the value 2 representing a rotten orange.
Every minute, any fresh orange that is adjacent (4-directionally) to a rotten orange becomes rotten.
Return the minimum number of minutes that must elapse until no cell has a fresh orange. If this is impossible, return -1 instead.

写了好一会了，想法好像错了，我打算在grid周围多加一圈0，相当于多加两行两列，然后后面的想法似乎是错了。。。
看了解法，知道自己为啥不会了，用了广度优先搜索。。。
自己许多算法都不会，真的要多学习，多做题。。。