Informatics2-2021/Lab11
A MathWikiből
(Változatok közti eltérés)
(→Deep Sum) |
(→Palindrome) |
||
| 11. sor: | 11. sor: | ||
===Palindrome=== | ===Palindrome=== | ||
| + | Write a recursive function which checks whether a given string is a palindrome or not. Then try to write a non recursive function for that and compare the time complexity. | ||
| + | |||
| + | Example: | ||
| + | aba -> True | ||
| + | abb -> False | ||
===Factorial=== | ===Factorial=== | ||
A lap 2021. április 27., 15:40-kori változata
Tartalomjegyzék |
Exercises
Dynamic programming
Deep Sum
Write a recursive function whose input is a list containing lists up to any depth containing positive integers. The function must return the sum of all numbers inside the list.
Example:
[1, 2, 3, [4, 5], [[[6], 7]]] -> 28
Palindrome
Write a recursive function which checks whether a given string is a palindrome or not. Then try to write a non recursive function for that and compare the time complexity.
Example:
aba -> True abb -> False
Factorial
Sum Digit
Sum Series
Power
Target
Finite State Machine
Parenthesis
Given a string, replace the enclosed parts of the string with a $ character. A formula is enclosed if it is surrounded by parenthesis. For example:
(xc)aa(c(b)) -> $$$$aa$$$$$$
