暂无搜索历史
WHERE name IN ('Sweden', 'Norway', 'Denmark')
Given an array of integers, return indices of the two numbers such that they add...
注:一般要分为两段的链表的双指针slow,fast = head, head.next; 不需要分为两段的slow,fast = head, head
快速排序使用分治法(Divide and conquer)策略来把一个序列(list)分为较小和较大的2个子序列,然后递归地排序两个子序列。
There are two sorted arrays nums1 and nums2 of size m and n respectively.
https://juejin.im/post/5c98b1785188252d665f57be#heading-0
Hadoop 使用 HDFS 来解决分布式数据问题,MapReduce 计算范式提供有效的分布式计算。
区间dp,顾名思义,在区间上dp,大多数题目的状态都是由区间(类似于dp[l][r]这种形式)构成的,就是我们可以把大区间转化成小区间来处理,然后对小区间处理后...
Given a non-empty array containing only positive integers, find if the array can...
Google 面试题 | Data Stream Median - Python版
Given a non-empty array of integers, return the k most frequent elements.
Given two words (beginWord and endWord), and a dictionary's word list, find the ...
A city's skyline is the outer contour of the silhouette formed by all the buildi...
总结:所有题目都已做,有些Easy没有做第二遍,有两道没有accept,请戳 link-en, link-cn
Leaders start with the customer and work backward. They work vigorously to earn ...
Given a 2d grid map of '1's (land) and '0's (water), count the number of islands...
Given n non-negative integers representing an elevation map where the width of e...
"有关递归的算法,都离不开“树”的遍历这一抽象模型。只不过对于不同的算法,在前(中)后序遍历的时候,所做的事不同而已。 "
总结:所有链表题目都做过而且都Accept了,不排除有些是抄的。。leet, leet-cn
暂未填写个人简介
暂未填写技能专长
暂未填写学校和专业
暂未填写个人网址
暂未填写所在城市