实现生产者和消费者问题。输入：由英文字母和数字组成的不定长度字符串数组，例如{“abc”,”23d”,”1a”}。每隔100毫秒，生产者线程读入数据，放入生产者公用的仓库；消费者从仓库中取出字符串，进行倒置，-Producers and consumers realize the problem. Input: letters and numbers from the adventitious length of the string array, for example, {" abc" , " 23d" , " 1a" }. Every 100 milliseconds, the producer thread reads the data warehouse into the public producers　consumers to remove the string from the warehouse, the inversion,