原创 Lintcode123 Word Search solution 題解
【題目描述】 Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of seq
2019-02-22 22:49:53
1
原创 Lintcode127 Topological Sorting solution 題解
【題目描述】 Given an directed graph, a topological order of the graph nodes is defined as follow: ·For each directed edgeA ->
2019-02-22 22:49:53
2
原创 Lintcode130 Heapify solution 題解
【題目描述】 Given an integer array, heapify it into a min-heap array. For a heap array A, A[0] is the root of heap, and for e
2019-02-22 22:49:53
原创 Lintcode121 Word Ladder || solution 題解
【題目描述】 Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, suc
2019-02-22 22:49:53
2
原创 MICROSOFT IDC 校招 INTERN五輪面經
我參加的是校園招聘，整個面試都是在學校裏進行的。抱着試一試的心態去投遞了簡歷，和很多高年級的人一塊競爭，一共進行了5輪面試，最終很榮幸拿到了Offer。現在來分享一下自己的面試經驗。 第一輪 技能測試 參加第一輪的一共有120個左右的同學。
2019-02-22 22:49:53
1
原创 Lintcode128 Hash Function solution 題解
【題目描述】 In data structure Hash, hash function is used to convert a string(or any other type) into an integer smaller than
2019-02-22 22:49:53
1
原创 Lintcode129 Rehashing solution 題解
【題目描述】 The size of the hash table is not determinate at the very beginning. If the total size of keys is too large (e.g.
2019-02-22 22:49:53
原创 Lintcode120 Word Ladder solution 題解
【題目描述】 Given two words (startandend), and a dictionary, find the length of shortest transformation sequence fromstarttoe
2019-02-22 22:49:53
原创 Lintcode122 Largest Rectangle In Histogram solutio
【題目描述】 Givennnon-negative integers representing the histogram's bar height where the width of each bar is 1, find the ar
2019-02-22 22:49:53
原创 Lintcode121 Word Ladder || solution 題解
【題目描述】 Given two words (startandend), and a dictionary, find all shortest transformation sequence(s) fromstarttoend, suc
2018-09-11 02:42:03
1
原创 Lintcode125 Backpack || solution 題解
【題目描述】 Givennitems with size Aiand value Vi, and a backpack with sizem. What's the maximum value can you put into the ba
2018-09-11 02:42:03
1
原创 Lintcode129 Rehashing solution 題解
【題目描述】 The size of the hash table is not determinate at the very beginning. If the total size of keys is too large (e.g.
2018-09-11 02:42:03
原创 Lintcode130 Heapify solution 題解
【題目描述】 Given an integer array, heapify it into a min-heap array. For a heap array A, A[0] is the root of heap, and for e
2018-09-11 02:42:03
原创 Lintcode127 Topological Sorting solution 題解
【題目描述】 Given an directed graph, a topological order of the graph nodes is defined as follow: ·For each directed edgeA ->
2018-09-11 02:42:03
2
原创 Lintcode128 Hash Function solution 題解
【題目描述】 In data structure Hash, hash function is used to convert a string(or any other type) into an integer smaller than
2018-09-11 02:42:03
4