yl_mouse的博客

题目描述：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...

此博主要是看了这篇的总结：https://github.com/CyC2018/CS-Notes/blob/master/notes/Leetcode 题解 - 贪心思想.md455. Assign Cookies分配饼干描述：每个孩子都有一个满足度，每个饼干都有一个大小，只有饼干的大小大于等于一个孩子的满足度，该孩子才会获得满足。求解最多可以获得满足的孩子数量。实例：Input: [1...

快速排序分而治之思路，设置一个基准数，然后将数组分成两组，大于基准数和小于基准数。def quick_sort(lis, i, j): if i > j: return temp = lis[i] l, r = i, j while l < r: while l < r and lis[r] >= te...

2 add 2 numbers题目描述You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the tw...

2sum题目描述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...

题目描述：给定一串数组，返回其中的最长递增子序列的长度。例如：给定数组[10, 9, 2, 5, 3, 7, 101, 18],则其最长递增子序列为[2, 3, 7, 101],返回长度4解题思路：用i来遍历从第二个元素开始，用j来便利i前面的数，判断J指向的元素是否小于i指向的元素？如果成立，则j对应的L序列+1和当前的i相比取大者，以此类推  10 9 2 5...

Given a string, your task is to count how many palindromic substrings in this string.The substrings with different start indexes or end indexes are counted as different substrings even they consist ...

题目描述：Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.You need to fi...

Suppose 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 k is the number of people in front of this ...

题目描述：You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it mu...

def decrease(A, B): for i, v in enumerate(A): if i == 0: pre = True next = True if A[i + 1] - v > 0 else False elif i == len(A)-1: pre = Tru...