dp(n) => O((number of recursive calls) ^ (number of inputs))
recursive callsis how many timesbacktrack(...)is called recursively
Fibonacci:
f(4)
/ \
| // If you have a function working on two arrays: | |
| const compareArrays = (nums1, nums2) => { | |
| ... | |
| } | |
| // And you need the larger or smaller array to be in a certain position, | |
| // you can do: | |
| const compareArrays = (nums1, nums2) => { | |
| // invoke function making smaller array first in the order: | |
| if (nums1.length > nums2.length) return compareArrays(nums2, nums1); |
| #!/bin/bash | |
| # Loop over all files in the current directory with a ".cue" extension | |
| for file in *.cue; do | |
| # Invoke chdman createcd with input and output options | |
| chdman createcd -i "${file%.*}.cue" -o "${file%.*}.chd" | |
| done |
Beelink Ser7
| [Profile] | |
| Device = Android/2/Xbox Wireless Controller | |
| Buttons/A = `Button A` | `Button R1` | |
| Buttons/B = `Button B` | |
| Buttons/1 = Start | |
| Buttons/2 = Back | |
| Buttons/- = `Axis 15+` | |
| Buttons/+ = `Select` | |
| ; You can change both of these to 100 if having trouble | |
| ; with range of movement of the analog stickes, |