Question
Can you help me in to flat this without recursion i.e simple loops? def fun(i, j, inp, dp): if i >=j : return True #
Can you help me in to flat this without recursion i.e simple loops?
def fun(i, j, inp, dp):
if i >=j : return True # means we are cheking upper matrix. if dp[i][j] != -1: return dp[i][j] # means already processed. if inp[i] != inp[j]: # means not matching ending chars dp[i][j] = False break dp[i][j] = fun(i+1, j-1, inp, dp) return dp[i][j]
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Advances In Spatial And Temporal Databases 10th International Symposium Sstd 2007 Boston Ma Usa July 2007 Proceedings Lncs 4605
Authors: Dimitris Papadias ,Donghui Zhang ,George Kollios
2007th Edition
