in Study / Rosalind on Rosalind problem
A problem from rosalind “Bioinformatics Stronghold” category, String Algorithm
- We can estimate the specific number whose value cannot be determined accurately
- We use tangent line (접선)
in Study / Rosalind on Rosalind problem
A problem from rosalind “Bioinformatics Stronghold” category, Boyer-Moore Algorithm
Baekjoon 2261
- Cumulative Sum (누적합)
- ex. [1, 2, 3] → cumulative sum : [1, 3 (1 + 2), 6 (1 + 2 + 3)]
- Difference (계차)
- L[i] - L[i-1]
- assume 0 index : first element of original list
- ex. [2, 8, 10, 12, 16] → difference : [2, 6 (8 - 2), 2 (10 - 8), 2 (12 - 10), 4 (16 - 12)]
- The relationship between cumulative sum and difference
- If A list → B list by cumulative sum’s procedure, A list is differece list of B list
- If A list → B list by differece’s procedure, A list is cumulative sum list of B list