代码片段仓库

func floydWarshall(graph [][]int) [][]int {
	n := len(graph)
	// Initialize dist matrix
	dist := make([][]int, n)
	for i := 0; i < n; i++ {
		dist[i] = make([]int, n)
		copy(dist[i], graph[i])
	}

	for k := 0; k < n; k++ {
		for i := 0; i < n; i++ {
			for j := 0; j < n; j++ {
				if dist[i][k] != math.MaxInt32 && dist[k][j] != math.MaxInt32 {
					if newDist := dist[i][k] + dist[k][j]; newDist < dist[i][j] {
						dist[i][j] = newDist
					}
				}
			}
		}
	}
	return dist
}

# 对字典列表进行多条件排序
users = [
    {'name': 'Alice', 'age': 30, 'score': 85},
    {'name': 'Bob', 'age': 25, 'score': 92},
    {'name': 'Charlie', 'age': 30, 'score': 78}
]

# 按年龄升序，然后按分数降序
sorted_users = sorted(users, key=lambda x: (x['age'], -x['score']))

function bubbleSort(&$arr) {
  $n = count($arr);
  for ($i = 0; $i < $n - 1; $i++) {
    for ($j = 0; $j < $n - $i - 1; $j++) {
      if ($arr[$j] > $arr[$j + 1]) {
        list($arr[$j], $arr[$j + 1]) = array($arr[$j + 1], $arr[$j]);
      }
    }
  }
}

function quickSort(arr) {
  if (arr.length <= 1) return arr;
  const pivot = arr[0];
  const left = [];
  const right = [];
  for (let i = 1; i < arr.length; i++) {
    if (arr[i] < pivot) {
      left.push(arr[i]);
    } else {
      right.push(arr[i]);
    }
  }
  return [.concat(quickSort(left), [pivot], quickSort(right));
}

function fibonacci(n) {
  if (n <= 1) return n;
  return fibonacci(n - 1) + fibonacci(n - 2);
}

function fibonacci($n) {
  if ($n <= 1) return $n;
  return fibonacci($n - 1) + fibonacci($n - 2);
}