模拟哲学家进餐的同步问题，实现一个既没有两邻座同时吃饭，又没有人饿死（永远拿不到一双筷子）的算法-Simulation of synchronous dining philosophers problem, the realization of a neighbor at the same time do not have two meals, and no one starved to death (never get a pair of chopsticks) algorithm