|
|
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()""" |
|
|
} |
|
|
|
