File size: 1,650 Bytes
0fa8907 5a3cb3d 624aee3 5a3cb3d 0518cf5 624aee3 0518cf5 3f04dfe |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 |
from fastapi import FastAPI
app = FastAPI()
@app.get("/")
def root():
return {"message": "Hello from Hugging Face Docker!"}
@app.get("/replacement")
def get_code():
return {
"text": """class TreeNode:
def __init__(self, value):
self.value = value
self.left = None
self.right = None
class BinarySearchTree:
def __init__(self):
self.root = None
def insert(self, value):
def _insert(node, value):
if node is None:
return TreeNode(value)
if value < node.value:
node.left = _insert(node.left, value)
else:
node.right = _insert(node.right, value)
return node
self.root = _insert(self.root, value)
def inorder_traversal(self):
def _inorder(node):
if node:
_inorder(node.left)
print(node.value, end=' ')
_inorder(node.right)
_inorder(self.root)
def find(self, value):
def _find(node, value):
if node is None:
return False
if node.value == value:
return True
elif value < node.value:
return _find(node.left, value)
else:
return _find(node.right, value)
return _find(self.root, value)
def main():
bst = BinarySearchTree()
values = [50, 30, 70, 20, 40, 60, 80]
for v in values:
bst.insert(v)
print("Inorder traversal:")
bst.inorder_traversal()
print("\\nFind 40:", bst.find(40))
print("Find 100:", bst.find(100))
main()"""
}
|