function fibonacci(n) { if (n <= 1) return n; return fibonacci(n - 1) + fibonacci(n - 2);}const result = fibonacci(10);console.log(`Fibonacci(10) = ${result}`);
Python:
def quicksort(arr): if len(arr) <= 1: return arr pivot = arr[len(arr) // 2] left = [x for x in arr if x < pivot] middle = [x for x in arr if x == pivot] right = [x for x in arr if x > pivot] return quicksort(left) + middle + quicksort(right)print(quicksort([3, 6, 8, 10, 1, 2, 1]))
SELECT u.name, COUNT(p.id) AS post_countFROM users uLEFT JOIN posts p ON u.id = p.author_idWHERE u.created_at > '2025-01-01'GROUP BY u.nameHAVING COUNT(p.id) > 5ORDER BY post_count DESC;
def hello(): return "Hello from a nested code block!"
第三项 - 包含图片和表格
A
B
1
2
第四项 - 包含任务列表
子任务 1
子任务 2
18. 长文本段落测试
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
Curabitur pretium tincidunt lacus. Nulla gravida orci a odio. Nullam varius, turpis et commodo pharetra, est eros bibendum elit, nec luctus magna felis sollicitudin mauris. Integer in mauris eu nibh euismod gravida. Duis ac tellus et risus vulputate vehicula. Donec lobortis risus a elit. Etiam tempor. Ut ullamcorper, ligula ut dictum pharetra, nisi nunc fringilla magna, in commodo elit erat nec turpis. Ut pharetra augue nec augue.