Min Moves Spread Stones

Given a 3x3 grid where cells contain 0 or more stones, find the minimum number of moves to make every cell contain exactly one stone. A move consists of moving one stone to an adjacent cell.

Examples
Input: [[1,1,0],[1,1,1],[1,2,1]]
Output: 3
Hints

Min Moves Spread Stones

Given a 3x3 grid where cells contain 0 or more stones, find the minimum number of moves to make every cell contain exactly one stone. A move consists of moving one stone to an adjacent cell.