Johnsonjjj的博客

题目描述You are given a list of non-negative integers, a1, a2, …, an, and a target, S. Now you have 2 symbols + and -. For each integer, you should choose one from + and - as its new symbol.Find out how...

最近这段时间偷懒了，嘿嘿，好多天没更新博客了。不行，还是要勤快一点才行。 　　 问题描述：Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest c

问题描述：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. You may

——Single Number 问题描述：Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it w

问题描述：Given a binary tree, find the maximum path sum.For this problem, a path is defined as any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The

问题描述：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.　　这道题大致的意思就是，一个链表，它每一个节点除了一个next引用

今天再次推出一套组合题。 　　首先是：141.Linked List Cycle 　　问题描述：Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?　　题目大致的意思就是给你一个链表，判断它里面是否含有环，有的话返回true，没有的

问题描述：Find the contiguous subarray within an array (containing at least one number) which has the largest product.For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest p

最近事情有点多，所以中间隔了很长时间没有写leetcode，也就很长时间没有更新博客了，望谅解哈。 　　今天重新开始写动态规划的题，遇到了一道非常有意思的题，必须要与大家分享一下。 　　问题描述：A sequence of numbers is called a wiggle sequence if the differences between successive numbers stric

问题描述：Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note:A solution using O(n) space is pretty straight forward. Could you devise a c

问题描述：Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(mn) space is probably a bad ide

问题描述：Given a 2D board and a word, find if the word exists in the grid.The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically

问题的具体描述：　　Given preorder and inorder traversal of a tree, construct the binary tree. Note: 　　You may assume that duplicates do not exist in the tree.　　这道题大致的意思就是，它会给你一棵二叉树的前序遍历序列和中序遍历序列，然后要你根据这两个序列来重

问题描述：　　Given inorder and postorder traversal of a tree, construct the binary tree.Note:　　You may assume that duplicates do not exist in the tree.　　题目大致的意思是给出一棵二叉树的中序遍历结果序列和后序遍历结果序列，让你根据这两个序列数组重新创建这棵树

问题描述：Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.　　这道题大致的意思是在一棵二叉树上，求根节点到叶子结点的最远层数（最远距离

问题描述：The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):１、"123"２、"132"３、"213"４、"23

问题描述：Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.　　这道题大致的意思是在一棵二叉树中求根节点到叶子结点的最小层数（最小距离）

问题描述：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7],　3 / \9 　20 / \ 1

问题描述：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7],　3 / \9 　20 / \ 1

问题描述：Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:

嘿嘿，这是我的第一篇博客，希望大家能够多多支持，多多指教。 这道题是LeetCode上的第一道题，问题描述是这样的： 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 wo