NP章第三題 首先，可知STINGY SAT的解可以在多項(xiàng)式的時(shí)間內(nèi)得出，因此屬于NP，另外很容易得知SAT可以歸為STINGY SAT問題，于是就可以得出STINGY SA...
發(fā)簡(jiǎn)信
IP屬地：廣東
-
Leetcode-Sort List
Description Sort a linked list in O(n log n) time using constant space complexity. Expl...
-
Vue-Socket.io源碼閱讀
背景 有一個(gè)項(xiàng)目，今年12月份開始重構(gòu)，項(xiàng)目涉及到了socket。但是socket用的是以前一個(gè)開發(fā)人員封裝的包（這個(gè)一直被當(dāng)前的成員吐槽為什么不用已經(jīng)千錘百煉的輪子）。因此...
-
Leetcode-Number of Longest Increasing Subsequence
Description Given an unsorted array of integers, find the number of longest increasing ...
-
Leetcode-Coin Change
Description You are given coins of different denominations and a total amount of money ...
-
Leetcode-Populating Next Right Pointers in Each Node
Description Given a binary tree Populate each next pointer to point to its next right n...
-
Leetcode- Counting Bits
Description Given a non negative integer number num. For every numbers i in the range 0...
-
Leetcode-Flatten Nested List Iterator
Description Given a nested list of integers, implement an iterator to flatten it. Each ...
-
Leetcode-Maximum Width of Binary Tree
Description Given a binary tree, write a function to get the maximum width of the given...
-
Leetcode-Search a 2D Matrix II
Description Write an efficient algorithm that searches for a value in an m x n matrix. ...
-
Leetcode-Climbing Stairs
Description You are climbing a stair case. It takes n steps to reach to the top. Each t...
-
Leetcode-Decode String
Given an encoded string, return it's decoded string. Description The encoding rule is: ...
-
Leetcode-Find Largest Value in Each Tree Row
Description You need to find the largest value in each row of a binary tree. Example:In...
-
React + Mobx構(gòu)建React-Cnode
背景 前一陣子，我剛寫了篇React全家桶實(shí)戰(zhàn)，介紹了下我用react全家桶構(gòu)建一個(gè)react webapp的中遇到的一些問題。后來，我發(fā)現(xiàn)了mobx。然后靜下心去看一看它的...
-
紀(jì)念我這幾年頂著富二代的帽子，過著無產(chǎn)階級(jí)生活的日子現(xiàn)在已經(jīng)大三了，兩年多以來，我應(yīng)該算是班里面為數(shù)不多沒有每個(gè)月為生活費(fèi)發(fā)愁的人了。室友們都曾羨慕我每個(gè)月可以輕輕松松花錢不用擔(dān)心下個(gè)月的費(fèi)用，有些人干脆直接論斷，我就是個(gè)富二...
-
Leetcode-Path Sum(2)
Description Given a binary tree and a sum, find all root-to-leaf paths where each path'...
-
Leetcode-Path Sum
Description Given a binary tree and a sum, determine if the tree has a root-to-leaf pat...
-
Leetcode-Remove K Digits
Description Given a non-negative integer num represented as a string, remove k digits f...
-
React全家桶實(shí)戰(zhàn)背景 學(xué)習(xí)一門前端框架，不動(dòng)手是不行的。所以當(dāng)我學(xué)習(xí)react有一段時(shí)間時(shí)，就打算開始寫一個(gè)react的個(gè)人項(xiàng)目,前后端一起寫的話，比較耗時(shí)間，所以就選了提供了優(yōu)質(zhì)api的C...
