努力学习的姜饼

题目Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this n...

题目Given an array of integers and an integer k, you need to find the total number of continuous subarrays whose sum equals to k.Example 1:Input:nums = [1,1,1], k = 2Output: 2Note:The length of th...

题目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 between any two nodes in a tree. This path may or ma...

题目Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first ...

题目Given a non-empty array of integers, return the k most frequent elements.Example 1:Input: nums = [1,1,1,2,2,3], k = 2Output: [1,2]我的想法用HashMap存频率，再根据频数进行快速排序或者归并排序。但不知道怎样存元素，class Solution {...

题目Given two arrays, write a function to compute their intersection.Example 1:Input: nums1 = [1,2,2,1], nums2 = [2,2]Output: [2,2]Example 2:Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]Output: [4,...

题目Sort a linked list in O(n log n) time using constant space complexity.Example 1:Input: 4->2->1->3Output: 1->2->3->4我的想法感觉用归并排序不会太复杂，但是实际写的时候越写越晕。以下代码并不对，只是为了记录class Solutio...

题目Given an array of integers nums, sort the array in ascending order.我的想法快排模板注意！！！为了使左右指针错开，以防止死循环，快排的所有判断都要带等号！class Solution { public List<Integer> sortArray(int[] nums) { qui...

题目A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list.我的想法在循环建立新链表的时候，用一个hashmap存入所有新建...

题目You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:struct Node { int val; Node *left; ...

题目Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is defined as a binary tree in which th...

题目Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).我的想法层级遍历二叉树，逢偶倒转listclass...

题目Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).Example:Input: S = “ADOBECODEBANC”, T = “ABC”Output: “BANC”Note:If t...

题目Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree [1,2,2,3,4,4,3] is symmetric: 1 / \ 2 2 / \ / \3 4 4 3B...

题目Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted in ascending from left to right.Integers in eac...

题目Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array.Cou...

题目Given a 2D board and a list of words from the dictionary, find all words in the board.Each word must be constructed from letters of sequentially adjacent cell, where “adjacent” cells are those hor...

题目Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.我的想法没太懂，感觉就是个排序的问题，为什么能算mediumclass Solution { pu...

题目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 sequence of one or more dictionary words.Note:Th...

题目Given a list of words (without duplicates), please write a program that returns all concatenated words in the given list of words.A concatenated word is defined as a string that is comprised entir...

题目Given a binary tree, return the values of its boundary in anti-clockwise direction starting from root. Boundary includes left boundary, leaves, and right boundary in order without duplicate nodes....

题目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 element on top of the stack.top() – Get t...

题目Design an iterator over a binary search tree with the following rules:Elements are visited in ascending order (i.e. an in-order traversal)next() and hasNext() queries run in O(1) time in average....

题目Given a non-empty binary search tree and a target value, find k values in the BST that are closest to the target.Example 1:Input:{1}0.0000001Output:[1]我的想法跟二分法的658. Find K Closest Elements...

题目Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.Example 1:Input: “aba”Output: TrueNote:The string will only contain lowercase chara...

题目Write a program to find the node at which the intersection of two singly linked lists begins.Notes:If the two linked lists have no intersection at all, return null.The linked lists must retain ...

题目Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares...

题目Given a collection of intervals, merge all overlapping intervals.Example 1:Input: [[1,3],[2,6],[8,10],[15,18]]Output: [[1,6],[8,10],[15,18]]Explanation: Since intervals [1,3] and [2,6] overlaps...

题目Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Example:Input: [1,2,3,4]Output: ...

题目Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.我的想法注意是把旧的node连接起来，不能new新的点。l1和l2长度不一定相等，最后记得把l1或者l2剩下...

题目Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:The solution set must not con...

题目Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.Example:Input: [-2,1,-3,4,-1,2,1,-5,4],Output: 6Explanati...

题目There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assume nums1 and ...

题目Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and put.get(key) - Get the value (will always be positive) of the key if ...

题目Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.我的想法最开始的想法是，当前结点的差值与左右子结点的差值比较，如果当前最小则输出当前，否则将当前结点设为较小的那个点，在继续循环。但是这样有个问题，当前最小并不一定...

题目Given a binary tree, flatten it to a linked list in-place.我的想法定义一个全局变量lastNode来存储前序遍历的最后一个结点，每次只需要把右子树的点接在lastNode后面即可。实现起来觉得很绕，写不出。class Solution { TreeNode lastNode; public void flatte...

题目Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes ...

题目Given a binary tree, return all root-to-leaf paths.我的想法遍历法，需要注意不能在root == null时把结果加入list，这样会重复计算，而且并没有走到真正的叶子结点(缺少一边的子树也会输出，但实际上这并不是叶子结点)public class Solution { public List<String> bin...

题目Given a binary tree, find the subtree with minimum sum. Return the root of the subtree.我的想法结合分治和遍历。利用遍历中的全局变量来记录最小值，利用分治的向上汇报来计算每一个结点的数值和class Result { TreeNode root; int sum; Result...

题目Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the sam...