fatttcat

摘要： Given a reference of a node in a connected undirected graph. Return a deep copy (clone) of the graph. Each node in the graph contains a val (int) and 阅读全文

摘要： In a row of dominoes, A[i] and B[i] represent the top and bottom halves of the ith domino. (A domino is a tile with two numbers from 1 to 6 - one on e 阅读全文

摘要： You are given an integer array prices where prices[i] is the price of a given stock on the ith day. Design an algorithm to find the maximum profit. Yo 阅读全文

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are ar 阅读全文

摘要： There are some spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal 阅读全文

摘要： You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It 阅读全文

摘要： Given an array of integers nums and an integer k, return the number of unique k-diff pairs in the array. A k-diff pair is an integer pair (nums[i], nu 阅读全文

摘要： You have a RecentCounter class which counts the number of recent requests within a certain time frame. Implement the RecentCounter class: RecentCounte 阅读全文

摘要： Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequ 阅读全文

摘要： Your are given an array of positive integers nums. Count and print the number of (contiguous) subarrays where the product of all the elements in the s 阅读全文