原创 [leetcode] 448. Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.
原创 [leetcode] 543. Diameter of Binary Tree
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the
原创 [leetcode] 477. Total Hamming Distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
原创 [leetcode] 513. Find Bottom Left Tree Value
Given a binary tree, find the leftmost value in the last row of the tree. Example 1: Input: 2 / \ 1 3 Ou
原创 [leetcode] 451. Sort Characters By Frequency
Given a string, sort it in decreasing order based on the frequency of characters. Example 1: Input: "tree" Output: "
原创 [leetcode] 530. Minimum Absolute Difference in BST
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two n
原创 [leetcode] 482. License Key Formatting
Now you are given a string S, which represents a software license key which we would like to format. The string S is c
原创 [leetcode] 539. Minimum Time Difference
Given a list of 24-hour clock time points in "Hour:Minutes" format, find the minimum minutes difference between any tw
原创 [leetcode] 529. Minesweeper
Let's play the minesweeper game (Wikipedia, online game)! You are given a 2D char matrix representing the game board
原创 [leetcode] 520. Detect Capital
Given a word, you need to judge whether the usage of capitals in it is right or not. We define the usage of capitals
原创 [leetcode] 517. Super Washing Machines
You have n super washing machines on a line. Initially, each washing machine has some dresses or is empty. For each m
原创 [leetcode] 523. Continuous Subarray Sum
Given a list of non-negative numbers and a target integer k, write a function to check if the array has a continuous s
原创 [leetcode] 495. Teemo Attacking
In LLP world, there is a hero called Teemo and his attacking can make his enemy Ashe be in poisoned condition. Now, gi
原创 [leetcode] 481. Magical String
A magical string S consists of only '1' and '2' and obeys the following rules: The string S is magical because concat
原创 [leetcode] 537. Complex Number Multiplication
Given two strings representing two complex numbers. You need to return a string representing their multiplication. No