贪婪算法、递归计算、动态规划背包问题_weixin_30354675的博客

        //贪婪算法计算背包问题
        public static double  ksack(double[] values, double[] weights, int capacity)
        {
            double load = 0;
            int i = 0;
            double w = 0;
            while (load<capacity && i<values.Length)
            {
                if (weights[i] <= (capacity-load))
                {
                    w += values[i];
                    load += weights[i];
                }
                else
                {
                    double r = (capacity - load) / weights[i];
                    w += r * values[i];
                    load += weights[i];
                }
                i++;
            }
            return w;
        }        //贪婪算法计算背包问题
     &n