Zhongju.copy()

摘要： Difficulty: Easy Related Topics: Array Link: https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/ Description Given an array of int 阅读全文

摘要： Difficulty: Easy Related Topics: Array, Two Pointers Link: https://leetcode.com/problems/move-zeroes/ Description Given an array nums, write a functio 阅读全文

摘要： Difficulty: Easy Related Topics: Array, Divide and Conqur, Bit Manipulation Link: https://leetcode.com/problems/majority-element/ Description Given an 阅读全文

摘要： Difficulty: Easy Related Topics: Linked List Link: https://leetcode.com/problems/reverse-linked-list/ Description Reverse a singly linked list. 反转一个单链 阅读全文

摘要： Difficulty: Easy Related Topics: Tree Description Invert a binary tree. 反转一棵二叉树 Examples Example 1 Input: 4 / \ 2 7 / \ / \ 1 3 6 9 Output: 4 / \ 7 2 阅读全文

摘要： [LeetCode] 136. Single Number（只出现一次的数） Difficulty: Easy Related Topics: Hash Table, Bit Manipulation https://leetcode.com/problems/single-number/ Desc 阅读全文

摘要： Difficulty: Easy Related Topics: Tree, Depth-first Search Link: https://leetcode.com/problems/maximum-depth-of-binary-tree/ Description Given a binary 阅读全文

摘要： Difficulty: Easy Related Topics: Tree Link: https://leetcode.com/problems/merge-two-binary-trees/ Description Given two binary trees and imagine that 阅读全文

摘要： 背景 三国杀近期搞了一个活动，其中一项内容就是完成一张 3×3 的滑动拼图。移动需要消耗步数，步数每天可以获得两次。拼图完成后即获得奖励，消耗步数最少的还会得到额外奖励。我自然是懒得手撕的那种人（实际上我也搞不懂这种滑动拼图的策略），于是想写程序解决该问题。 目标 这里的滑动拼图，与人们所熟知的数字 阅读全文