Given an array of n elements with all elements positive generate all possible according to 2 rules:- 1)Consider any 2 adjacent elements i and i+1 and i+1 is not the last element so you can decrease both by 1 and add 1 to the i+1 th element. 2)if i+1 is the last element so u can reduce both by 1 and append 1 to the last.
topchoder/backtracking-
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|