To overcome the defects of the slow convergence speed and precocity of Discrete Differential Evolution (DDE)-MRR algorithm, a new DDE algorithm is proposed to solve the Cooperative Jamming Resource Allocation (CJRA) problem in electronic countermeasures. Firstly, the samples of the species group are reconstructed based on the inequality of D/N in CJRA problem. Secondly, the DE/best/1 strategy is used for mutation operation. Finally, the sample refreshment is implemented by greedy strategy. Three experiments are designed to analyze the convergence and numerical performance, and the results show that the proposed algorithm is more efficient and has practical value for solving the CJRA problem.