全站内容
Calf
这里收录 Calf 在 GoCalf 上的文章、笔记与其他内容。
- twilight-princess
《塞尔达传说：黎明公主》攻略：剧情介绍
前年的时候花了好多个晚上的时间在 Wii 上玩了《塞尔达传说：黎明公主》（The Legend of Zelda: Twilight Princess），真的是很不错的游戏呢。当时搜了很多的攻略，现在就贴在这里吧。基本上是参考了网上已有的攻略，但结合自己的实践也做了整理和修订。
1. Two Sum
#Problem Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. …
100. Same Tree
#Problem Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have the same value. …
1014. Best Sightseeing Pair
#Problem You are given an integer array values where values[i] represents the value of the iᵗʰ sightseeing spot. Two sightseeing spots i and j have a distance j - i between them. The score of a pair (i < j) of sightseeing spots is values[i] …
102. Binary Tree Level Order Traversal
#Problem Given the root of a binary tree, return the level order traversal of its nodes’ values. (i.e., from left to right, level by level). https://leetcode.com/problems/binary-tree-level-order-traversal/ Example 1: case1Input: root = …
1028. Recover a Tree From Preorder Traversal
#Problem We run a preorder depth-first search (DFS) on the root of a binary tree. At each node in this traversal, we output D dashes (where D is the depth of this node), then we output the value of this node. If the depth of a node is D, …
1029. Two City Scheduling
#Problem A company is planning to interview 2n people. Given the array costs where costs[i] = [aCostᵢ, bCostᵢ], the cost of flying the iᵗʰ person to city a is aCostᵢ, and the cost of flying the iᵗʰ person to city b is bCostᵢ. Return the …
104. Maximum Depth of Binary Tree
#Problem Given the root of a binary tree, return its maximum depth. A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. …