recursive

문제 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list. You may assume the two numbers do not contain any leading zero, except the number 0 itself. Example: Input: (2 -> 4 -> 3) + (5 -> 6 -> 4) Output: 7 -> 0 -> 8 Explanation: 342 ..

풀이 #include #include using namespace std; vector SubSet; vector Seq(6); int n; int fnSolve(int idx,/* 고려하는 SubSet Index */ int cnt /* 선택한 갯수 */) { if (idx > n) { return 0; } if (cnt == 6) { cout