mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Create Non-crossing-lines-to-connect-points-in-a-circle

Browse Source
This commit is contained in:
A Safari 2018-11-28 15:54:19 -05:00 committed by GitHub
parent 6a95bf9ad8
commit 98db791d37
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 10 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
dynamic_programming/Non-crossing-lines-to-connect-points-in-a-circle Normal file
View File

@ -0,0 +1,10 @@
def count(n):
if (n & 1):
return 0
val = n // 2
dy_lst = [1 for i in range(val + 1)]
for i in range(2, val + 1):
dy_lst[i] = 0
for j in range(i):
dy_lst[i] += (dy_lst[j] * dy_lst[i - j - 1])
return dy_lst[val]