用贪心算法解题: 设n是一个正整数。现在要求将n分解为若干互不相同的自然数的和，且使这些自然数 的乘积最大。-Greedy algorithm with problem-solving: Let n be a positive integer. N decomposition will now require a number of separate and natural number, and make them the product of the largest natural nu

马踏棋盘贪心算法，时间复杂度小，效率高,-Horse riding chessboard greedy algorithm, the time complexity, high efficiency,

现有的贪婪迭代类压缩感知重构算法均基于最小二乘对信号进行波形估计，未考虑到可能将量测噪声引入信号估计的情况．针对以上不足，提出了一种基于线性Kalman滤波的压缩感知弱匹配去噪重构算法-Existing greedy iterative reconstruction algorithms class compressed sensing the signal waveform based on least squares estimation does not take into account