xu_xyy的博客

LeetCode---Add Two Numbers Difficulty:MediumC++

最近在整理课本第六章动态规划的课后习题，就顺便找leetcode上的题目做啦，顺便复习。。1 题目Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player

题目Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum siz

复习一下广度优先搜索BFS111. Minimum Depth of Binary Tree515. Find Largest Value in Each Tree Row 542. 01 Matrix

1 题目Given two strings representing two complex numbers.You need to return a string representing their multiplication. Note i2 = -1 according to the definition.Example 1:Input: "1+1i",

题目        还是动态规划，学到这里算是有了一点感觉，这个题也算是整理一下课堂的学习吧~        点击打开链接        编辑距离，也就是求两个字符串之间的最短距离，应用实例如搜索引擎（提示你查找的是不是“xxxx”）、医学信息工程的基因问题研究等。分析       字符串：x[1...m] 和y[1...n]       E[i

521. Longest Uncommon Subsequence I172. Factorial Trailing Zeroes26. Remove Duplicates from Sorted Array

1 题目Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators are+, - and *.Exam

406. Queue Reconstruction by HeightSuppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height of the person and 

1 题目Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by arraynums. You are asked to burst all the balloons. If the you burst ballooni you will get

1 题目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 consecutive elements sequence is [1,

很久没有做过算法题了，脑子也不太好用了，趁着算法课的机会学习一下，这周选了最简单的第一题来做。LeetCode Two Sum，题目如下所示：由于一开始也没有特别多的思路，秉承着先做到再做好的信仰，用了两种方法：（1）一开始使用了最暴力的方法，也就是使用两个循环，显然O(N2)的时间复杂度使得算法超时了。（2）先对数组进行排序，由于排序会使位置发生改变，因此使用结构体记录下数值

1 题目分析    题目链接：点击打开链接    题目就是小时候玩过的扫雷游戏，总结一下规则，在本题中规则也就是思路了：    ① 扫到M → 用X替换M，游戏结束（返回board）    ② 扫到E → 计算其周围（8个方向）的M的个数Mcount                           → Mcount > 0，用Mcount替换E

Maximum Subarray (E) Maximum Product Subarray (M)C++

题目点击打开链接给定一个二叉树，找出最左边的DFS，即返回最大深度BFS，保存每层的第一个值，最后一层的值即为所求

1 题目    寻找数组中次数多于⌊n/2⌋次的元素，即主元素/众数    题目链接：点击打开链接2 思路和实现   （1） 分治算法：             将数组分为左右两边，分别找出左右两边的主元素并计算其出现的频率，对比频率找出每个小问题的主元素，递归调用完成算法。             class Solution {public: int

1 题目求字符串的最长回文子序列长度Given a string s, find the longest palindromic subsequence's length in s. You may assume that the maximum length of s is 1000.Example 1:Input:"bbbab"Output:4O

这星期老师刚好讲到动态规划，讲了最长递增子序列（LIS）问题，于是在LeetCode中找了该题来做1 题目     求最长递增子序列长度。即在一个给定的数值序列中，找到一个子序列，使得这个子序列元素的数值依次递增，并且这个子序列的长度尽可能地大。最长递增子序列中的元素在原序列中不一定是连续的。这是一道动态规划的典型问题     点击打开链接2 分析     该题

1 题目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.Intege