![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]](https://image.slidesharecdn.com/canyouhelpmeintoflatthiswithoutrecursioni-esimpleloops-d-230222082513-e9afb3d0/85/Can-you-help-me-in-to-flat-this-without-recursion-i-e-simple-loops-d-docx-1-320.jpg)
Recommended
Recommended
More Related Content
More from CharlesCSZWhitei
More from CharlesCSZWhitei (15)
Recently uploaded
Recently uploaded (20)
Can you help me in to flat this without recursion i-e simple loops- d.docx
- 1. 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]