• leetcode — combination-sum


    import java.util.ArrayList;
    import java.util.Arrays;
    import java.util.List;
    
    /**
     * Source : https://oj.leetcode.com/problems/combination-sum/
     *
     * Created by lverpeng on 2017/7/14.
     *
     * Given a set of candidate numbers (C) and a target number (T), find all unique combinations
     * in C where the candidate numbers sums to T.
     *
     * The same repeated number may be chosen from C unlimited number of times.
     *
     * Note:
     *
     * All numbers (including target) will be positive integers.
     * Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
     * The solution set must not contain duplicate combinations.
     *
     * For example, given candidate set 2,3,6,7 and target 7,
     * A solution set is:
     * [7]
     * [2, 2, 3]
     *
     */
    public class CombinationSum {
        private List<List<Integer>> result = new ArrayList<List<Integer>>();
    
        /**
         * 先考虑一个数字,比如第一位,其他位以此类推,第一位为例
         *
         *
         * @param num
         * @param start
         * @param end
         * @param target
         * @param list
         */
        public void combinationSum (int[] num, int start, int end,  int target, List<Integer> list) {
            if (target == 0 && list.size() > 0) {
                Integer[] newList = new Integer[list.size()];
                System.arraycopy(list.toArray(new Integer[list.size()]), 0, newList, 0, list.size());
                result.add(Arrays.asList(newList));
                return ;
            }
            int index = start;
            int multiple = 0;
            while (index <= end && num[index] <= target) {
                if (index > start && num[index] == num[index-1]) {
                    index ++;
                    continue;
                }
                multiple = target / num[index];
                for (int i = 1; i <= multiple; i++) {
                    int newTarget = target - i * num[index];
                    list.add(num[index]);
                    combinationSum(num, index + 1, end, newTarget, list);
                    list.remove(list.size() - 1);
                }
                index ++;
    
            }
        }
    
        public List<List<Integer>> combination (int[] num, int target) {
            Arrays.sort(num);
            List<Integer> combinationList = new ArrayList<Integer>();
            combinationSum(num, 0, num.length - 1, target, combinationList);
            return result;
        }
    
        private static void printMatrix (List<List<Integer>> list) {
            StringBuilder stringBuilder = new StringBuilder();
            for (List<Integer> intList : list) {
                for (Integer num : intList) {
                    stringBuilder.append(num);
                    stringBuilder.append(", ");
                }
                stringBuilder.delete(stringBuilder.length() - 2, stringBuilder.length() - 1);
                stringBuilder.append("
    ");
            }
            System.out.println(stringBuilder);
        }
    
        public static void main(String[] args) {
            CombinationSum combinationSum = new CombinationSum();
            int[] num = new int[]{2,3,6,7};
            printMatrix(combinationSum.combination(num, 7));
        }
    }
    
  • 相关阅读:
    ORACLE分页SQL语句
    oracle中主键自增
    html5video初试牛刀api
    如何修改tomcat的端口号
    用Java来获取访问者真实的IP地址
    根据txt文件处理的方法总结
    CXF 做 webservice 简单例子demo
    java创建TXT文件并进行读、写、修改操作
    POJ1047 Round and Round We Go
    NYOJ305 表达式求值
  • 原文地址:https://www.cnblogs.com/sunshine-2015/p/7461233.html
Copyright © 2020-2023  润新知