mingL

2019年5月30日

摘要： 137. Single Number II Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that sin 阅读全文

posted @ 2019-05-30 23:26 mingL 阅读(161) 评论(0) 推荐(0) 编辑

136. Single Number（js）

摘要： 136. Single Number Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should 阅读全文

posted @ 2019-05-30 23:23 mingL 阅读(144) 评论(0) 推荐(0) 编辑

135. Candy（js）

摘要： 135. Candy There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the f 阅读全文

posted @ 2019-05-30 23:18 mingL 阅读(84) 评论(0) 推荐(0) 编辑

2019年5月29日

134. Gas Station（js）

摘要： 134. Gas Station There are N gas stations along a circular route, where the amount of gas at station iis gas[i]. You have a car with an unlimited gas 阅读全文

posted @ 2019-05-29 22:41 mingL 阅读(156) 评论(0) 推荐(0) 编辑

133. Clone Graph（js）

摘要： 133. Clone Graph Given a reference of a node in a connected undirected graph, return a deep copy(clone) of the graph. Each node in the graph contains 阅读全文

posted @ 2019-05-29 22:26 mingL 阅读(133) 评论(0) 推荐(0) 编辑

2019年5月26日

132. Palindrome Partitioning II（js）

摘要： 132. Palindrome Partitioning II Given a string s, partition s such that every substring of the partition is a palindrome. Return the minimum cuts need 阅读全文

posted @ 2019-05-26 23:03 mingL 阅读(117) 评论(0) 推荐(0) 编辑

131. Palindrome Partitioning（js）

摘要： 131. Palindrome Partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome 阅读全文

posted @ 2019-05-26 22:05 mingL 阅读(156) 评论(0) 推荐(0) 编辑

2019年5月25日

130. Surrounded Regions（js）

摘要： 130. Surrounded Regions Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flippin 阅读全文

posted @ 2019-05-25 20:35 mingL 阅读(134) 评论(0) 推荐(0) 编辑

129. Sum Root to Leaf Numbers（js）

摘要： 129. Sum Root to Leaf Numbers Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the 阅读全文

posted @ 2019-05-25 20:16 mingL 阅读(170) 评论(0) 推荐(0) 编辑

2019年5月23日

128. Longest Consecutive Sequence（js）

摘要： 128. Longest Consecutive Sequence Given an unsorted array of integers, find the length of the longest consecutive elements sequence. Your algorithm sh 阅读全文

posted @ 2019-05-23 23:47 mingL 阅读(86) 评论(0) 推荐(0) 编辑

2019年5月22日

127. Word Ladder（js）

摘要： 127. Word Ladder Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence from begin 阅读全文

posted @ 2019-05-22 23:29 mingL 阅读(200) 评论(0) 推荐(0) 编辑

126. Word Ladder II（js）

摘要： 126. Word Ladder II Given two words (beginWord and endWord), and a dictionary's word list, find all shortest transformation sequence(s) from beginWord 阅读全文

posted @ 2019-05-22 23:20 mingL 阅读(177) 评论(0) 推荐(0) 编辑

2019年5月15日

react 生命周期钩子函数

摘要：跳槽了，听说这是一家使用react的公司。这几天上班工作交接之余看了下react，网上找了几篇博客几乎都是长篇大论的，我很不喜欢，感觉就是你抄抄我的，我抄抄你的，没有自己的思想想法在里面。盗图一份（react生命周期所有钩子函数）： react 核心原理就是通过优化过的diff算法比较两棵树（虚拟阅读全文

posted @ 2019-05-15 20:30 mingL 阅读(164) 评论(0) 推荐(0) 编辑

2019年5月14日

125. Valid Palindrome（js）

摘要： 125. Valid Palindrome Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. Note: For the purp 阅读全文

posted @ 2019-05-14 20:26 mingL 阅读(139) 评论(0) 推荐(0) 编辑

124. Binary Tree Maximum Path Sum（js）

摘要： 124. Binary Tree Maximum Path Sum Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nod 阅读全文

posted @ 2019-05-14 20:23 mingL 阅读(81) 评论(0) 推荐(0) 编辑

2019年5月13日

123. Best Time to Buy and Sell Stock III（js）

摘要： 123. Best Time to Buy and Sell Stock III Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm t 阅读全文

posted @ 2019-05-13 21:21 mingL 阅读(191) 评论(0) 推荐(0) 编辑

122. Best Time to Buy and Sell Stock II（js）

摘要： 122. Best Time to Buy and Sell Stock II Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to 阅读全文

posted @ 2019-05-13 20:46 mingL 阅读(107) 评论(0) 推荐(0) 编辑

121. Best Time to Buy and Sell Stock（js）

摘要： 121. Best Time to Buy and Sell Stock Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitte 阅读全文

posted @ 2019-05-13 20:44 mingL 阅读(103) 评论(0) 推荐(0) 编辑

2019年5月7日

120. Triangle（js）

摘要： 120. Triangle Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example 阅读全文

posted @ 2019-05-07 22:12 mingL 阅读(120) 评论(0) 推荐(0) 编辑

119. Pascal's Triangle II（js）

摘要： 119. Pascal's Triangle II Given a non-negative index k where k ≤ 33, return the kth index row of the Pascal's triangle. Note that the row index starts 阅读全文

posted @ 2019-05-07 22:05 mingL 阅读(96) 评论(0) 推荐(0) 编辑

公告