跳转至

代码示例

多语言代码高亮

import numpy as np

def fibonacci(n):
    a, b = 0, 1
    for _ in range(n):
        yield a
        a, b = b, a + b

print(list(fibonacci(10)))
# [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

function fibonacci(n) {
  const result = [0, 1];
  for (let i = 2; i < n; i++) {
    result.push(result[i - 1] + result[i - 2]);
  }
  return result;
}

console.log(fibonacci(10));

package main

import "fmt"

func fibonacci(n int) []int {
    result := []int{0, 1}
    for i := 2; i < n; i++ {
        result = append(result, result[i-1]+result[i-2])
    }
    return result
}

func main() {
    fmt.Println(fibonacci(10))
}

行号显示

1
2
3
4
5
6
7
8
def quick_sort(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 quick_sort(left) + middle + quick_sort(right)

代码标注

def greet(name):  # (1)
    return f"Hello, {name}!"
  1. 这是一个简单的问候函数。