zoukankan      html  css  js  c++  java
  • 494. Target Sum

    You are given a list of non-negative integers, a1, a2, ..., an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.

    Find out how many ways to assign symbols to make sum of integers equal to target S.

    Example 1:

    Input: nums is [1, 1, 1, 1, 1], S is 3. 
    Output: 5
    Explanation: 
    
    -1+1+1+1+1 = 3
    +1-1+1+1+1 = 3
    +1+1-1+1+1 = 3
    +1+1+1-1+1 = 3
    +1+1+1+1-1 = 3
    
    There are 5 ways to assign symbols to make the sum of nums be target 3.
    

     

    Note:

    1. The length of the given array is positive and will not exceed 20.
    2. The sum of elements in the given array will not exceed 1000.
    3. Your output answer is guaranteed to be fitted in a 32-bit integer.

    改变一组数的正负号使得它们的和为一给定数

    C++(1056ms):dfs

     1 class Solution {
     2 public:
     3     int findTargetSumWays(vector<int>& nums, int S) {
     4         return dfs(nums,0,S) ;
     5     }
     6     
     7     int dfs(vector<int>& nums, int start , int S){
     8         if(start == nums.size()){
     9             return S == 0 ? 1 : 0 ;
    10         }
    11         
    12         return dfs(nums,start+1,S + nums[start]) + dfs(nums,start+1,S - nums[start]) ;
    13     }
    14 };
  • 相关阅读:
    CNN的学习记录
    softmax和softmax loss的学习记录
    Vue2.0 生命周期
    Vue methods 方法
    Vue2.0 全局操作 Vue.set
    Vue2.0 自定义指令 vuedirective
    Vue2.0 构造器的延伸 Vue.extend
    vue computed
    vuecli 脚手架分析
    h5表单介绍与案例
  • 原文地址:https://www.cnblogs.com/mengchunchen/p/10267677.html
Copyright © 2011-2022 走看看