codingEskimo

摘要： We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppos 阅读全文

摘要： Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path betwe 阅读全文

摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) Push element x onto stack. pop() Removes the 阅读全文

摘要： Given two strings S and T, return if they are equal when both are typed into empty text editors. means a backspace character. Example 1: Example 2: Ex 阅读全文

摘要： Given a non empty, singly linked list with head node head, return a middle node of linked list. If there are two middle nodes, return the second middl 阅读全文

摘要： Given an integer array arr, count element x such that x + 1 is also in arr. If there're duplicates in arr, count them seperately. Example 1: Example 2 阅读全文

摘要： Given an array of strings, group anagrams together. Example: Note: All inputs will be in lowercase. The order of your output does not matter. 这道题就是用每个 阅读全文

摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文

摘要： Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文

摘要： Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non zero elements. Example: Input: 阅读全文