无名路人甲

摘要： 算法描述： Given a list of non negative integers, arrange them such that they form the largest number. Example 1: Example 2: Note: The result may be very l 阅读全文

摘要： 算法描述： Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling next() will return 阅读全文

摘要： 算法描述： Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is rep 阅读全文

摘要： 算法描述： Compare two version numbers version1 and version2.If version1 > version2 return 1; if version1 < version2 return -1;otherwise return 0. You may 阅读全文

摘要： 算法描述： A peak element is an element that is greater than its neighbors. Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and r 阅读全文

摘要： 算法描述： Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord to endWord, s 阅读全文

摘要： 算法描述： Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put. get(key) - G 阅读全文

摘要： 算法描述： Given a binary tree, return the postorder traversal of its nodes' values. Example: Follow up: Recursive solution is trivial, could you do it ite 阅读全文

摘要： 算法描述： There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the follow 阅读全文

摘要： 算法描述： Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts needed for a palindrome partit 阅读全文