1872. 连接棒材的最低费用

1872. 连接棒材的最低费用

 

 

为了装修新房，你需要加工一些长度为正整数的棒材 sticks。

如果要将长度分别为 X 和 Y 的两根棒材连接在一起，你需要支付 X + Y 的费用。 由于施工需要，你必须将所有棒材连接成一根。

返回你把所有棒材 sticks 连成一根所需要的最低费用。注意你可以任意选择棒材连接的顺序

样例

样例 1:

输入：

[2,4,3]

输出：14

解释：先将 2 和 3 连接成 5，花费 5；再将 5 和 4 连接成 9；总花费为 14

样例 2:

输入：

[1,8,3,5]

输出：30

注意事项

• 1 \leq sticks.length \leq 10^4
  1≤sticks.length≤1
  0
  4
• 1 \leq sticks[i] \leq 10^4
  1≤sticks[i]≤1
  0
  4

 

 

 

public class Solution {

    /**

     * @param sticks: the length of sticks

     * @return: Minimum Cost to Connect Sticks

     */

    public int MinimumCost(List<Integer> sticks) {

        int sum = 0;

            while (sticks.size() > 2) {

                int p = sticks.get(0), q = sticks.get(1);

                for (int i = 2; i < sticks.size(); i++) {

                    if (sticks.get(i) < p) {

                        if (p< q) {

                            q = p;

                         }

                        p = sticks.get(i);

                        

                    } else if (sticks.get(i) < q) {

                        q = sticks.get(i);

                    }

                }

                sticks.remove((Integer) p);

                sticks.remove((Integer) q);

                

                int temp = p + q;

                sum += temp;

                sticks.add(temp);

                // System.out.println(p + "," + q+","+sticks.size());

            }

            return sum + sticks.get(0)+sticks.get(1);

    }

}