题目 Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing f…

题目 Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the va…

题目 Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered…

题目 Reverse a singly linked list. 解题思路 头插法 代码 /** * Definition for singly-linked list. * type ListNode struct {…

题目 Implement the following operations of a queue using stacks. push(x) — Push element x to the back of q…

题目 Given two strings s and t which consist of only lowercase letters. String t is generated by random shufflin…

本题目测试中给出了 初始化链表 和 判断两个链表是否相同 的方法 题目 Given a sorted linked list, delete all duplicates such that each element a…

题目 Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums…

题目的通过率越来越低，题目越来越长，题意不好理解，边界问题，优化问题叠加，导致解题时间大大增加，对我的目标–快速复习一遍技术数据结构和算法阻碍很大啊！已经写了一百多道题了，是时候针对性的做一些题目了。目前打算…

二叉树的题目挺多的，写了个初始化二叉树的函数，以后用 func InitTree(index int, input []int) (t *TreeNode) { if index > len(input) { re…

题目 The count-and-say sequence is the sequence of integers with the first five terms as following: 1 11 21 1211…

题目 Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2, 1], nums…