leetcode刷的头疼

rocketdive 发表于 2017-12-20 15:14
楼主 “揭发特比巧”是啥意思啊？看不懂代码 现在竟然连中文也看不懂了。。。

解法特别巧

rocketdive 发表于 2017-12-20 15:14
楼主 “揭发特比巧”是啥意思啊？看不懂代码 现在竟然连中文也看不懂了。。。

sorry 打错了

iwantanintern 发表于 2017-12-21 10:21
sorry 打错了

加油哇！我也刷hard很痛苦，但相信这一切都会值得

shurui91 发表于 2017-12-20 15:27
解法特别巧

哈哈哈 我还以为是啥行业黑话。。

如果感觉很累，那么参加竞赛是拿不了奖。

冷门的hard其实没有刷的必要，尤其是对付FB这种题库不大相对又比较固定的公司，刷面经比较重要。
而经典的hard，其实难度就很一般，自然是要很熟的。

ourgit 发表于 2017-12-21 10:42
如果感觉很累，那么参加竞赛是拿不了奖。

我不打竞赛

lz变秃了 也变强了

LC 252 / 253 Meeting Room I II ++

LC 152 Maximum Product Subarray (返回区间)

LC 311 Sparse Matrix Multiplication

LC 10 Regular Expression Matching  +++

LC 44 Wildcard Matching

LC 283 Move Zeros +++++++++++

LC 140 Word Break II ++

LC 76 Minimum Window Substring  +++++

LC 304 / 308 Range Sum Query 2D ++++

LC 543 Diameter of Binary Tree

LC 173 Binary Search Tree Iterator

LC 17 Letter Combinations of a Phone Number

LC 65 Valid Number

LC 341 Flatten Nested List Iterator ++++

LC 125 Valid Palindrome +++++

LC 200 / 305 Numbers of Island I II ++++

LC 67 Add Binary ++++++ (other bases)

LC 98 Validate Binary Search Tree (Recursive and Iterative)

LC 28 Implement strStr()

LC 211 Add and Search Word - Data structure design

LC 680 Valid Palindrome II

LC 387 First Unique Character in a String

LC 215 Kth Largest Element in an Array

LC 105 Construct Binary Tree from Preorder and Inorder Traversal

LC 212 Word Search II

LC 91 Decode Ways ++++++++

000, 134, 101

Rolling array

LC 1 Two Sum

LC 350 Intersection of Two Arrays II

LC 33 Search in Rotated Sorted Array +++

LC 71 Simplify Path

LC 133 Clone Graph +++++

LC 373 Find K Pairs with Smallest Sums

LC 301 Remove Invalid Parentheses +++++++++

LC 157 / 158 Read N Characters Given Read4 I II - Call multiple times

LC 12 / 13  Integer to Roman / Roman to Integer

LC 325 Maximum Size Subarray Sum Equals k
. 1point3acres
LC 143 Reorder List +++

LC 257 Binary Tree Paths

LC 189 Rotate Array (k can be negative) +++

LC 297 Serialize/Deserialize BST (Tree) +++++++++

LC 56 / 57 Merge Intervals / Insert Interval ++

LC 295 Find Median from Data Stream

LC 384 Shuffle an Array / Shuffle Weighted Array

LC 332 Reconstruct Itinerary

LC 239 Sliding Window Maximum / Minimum

Josephus ring Josephus problem

LC 246 / 247 / 248 Strobogrammatic Number I II

LC 277 Find the Celebrity +++

LC 415 Add Strings

LC 116 / 117 Populating Next Right Pointers in Each Node I II

每一个level的最后一个node的next要指向下一层的第一个node

LC 15 3Sum +++++  4Sum

同一个数字现在可以重复利用，但是数组里面没有重复

duplicate elements

LC 62 / 63 Count Unique Path I II

LC 347 https://stackoverflow.com/questions/20398799

LC 273 Integer to English Words

LC 134 Gas Station

LC 75 Sort Colors (k categories)

LC 235 Lowest Common Ancestor of a Binary Search Tree

LC 53 Maximum Subarray

LC 39 Combination Sum

Kth smallest element in BST

Max Sum of Rectangle No Larger Than K

Subset

LC 121 / 122 / 123 Best Time to Buy and Sell Stock- I II III

.--LC 554 Brick Wall

follow up是这面墙的高度很小，但是宽度很大，每一行可能有特别特别多的砖，问你怎么办。

k closest points to (0,0)，

楼主用了priority queue，

quick select

longest arithmetic sequence 面经题 唯一和我看到的不同处是要求返回最长sequence

valid IP in string format and return the uint32 format
-baidu 1point3acres

LC 236 Lowest Common Ancestor of a Binary Tree

in-place replace all "%20" in a string to a space

abc%20def -> abc def

abc%20%20%2 -> abc  %2

LC 29 Divide Two Integers +++

LC 20 Valid Parentheses
. .и
. ----LC 278 First Bad Version

LC 66 Plus One

LC 146 LRU


find the max and min of an array with minimum comparisons Link

given k sorted array, each array has n posts, find the shortest interval contains at least 1 post from each array Link

LC 340 Longest substring with at most k different chars

Implement circular buffer with read & write functions

LC 314 Binary tree vertical traverse

LC 273 Integer to English Words

LC 72 Edit distance

Merge K iterators

LC 138 Copy List with Random Pointer

hashmap+递归写的，老哥一直问 1进来了  what next， 我没懂想让我讲啥 我就在解释算法啊，  其实是让我口头run一个text case吧。。

LC 523 Continuous Subarray Sum

LC 88 Merge Sorted Array

LC 102 Print binary tree level by level

input是一个string，求出所有可能的大小写组合。 比如ab 返回：Ab，ab，aB，AB

是给一个prime number 数组, 返回相乘的结果集。 比如 input = [3,5,7], output = [3,5,7,15,21,35,105]

给一个array和k，求size为k的所有subarray最大的最大值。一个loop就能搞定

求3个size为k的subarray的最大值，subarray之间不能overlap。

没想出来，给了个O(N^3)的暴力解，肯定要gui。最后问三哥说有O(N) 的解。有谁知道咋做吗？

. 给你一个数字比如111112222333112，返回每个数字出现的个数和数字本身，这个例子的返回为5142332112. 写完之后问这个返回的result，最短多长，最长多长。

LC 282 Expression Add Operators

LC 494 Target Sum

LC 127 Word Ladder

为了准备Facebook的话，没必要刷所有hard的题，按Facebook面经刷就行了，脸家基本就那些题，而且难题比较少