原创 Lintcode90 K Sum || solution 題解
【題目描述】Given n unique integers, number k (1<=k<=n) and target.Find all possible k integers where their sum is target.給定n個
2019-02-22 21:35:13
原创 Lintcode91 Minimum Adjustment Cost solution 題解
【題目描述】Given an integer array, adjust each integers so that the difference of every adjacent integers are not greater tha
2019-02-22 21:35:13
原创 Lintcode93 Balanced Binary Tree solution 題解
【題目描述】Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined
2019-02-22 21:35:13
原创 Lintcode91 Minimum Adjustment Cost solution 題解
【題目描述】Given an integer array, adjust each integers so that the difference of every adjacent integers are not greater tha
2019-02-22 21:35:12
原创 Lintcode92 Backpack solution 題解
【題目描述】Givennitems with size Ai, an integermdenotes the size of a backpack. How full you can fill this backpack?在n個物品中挑選若
2019-02-22 21:35:12
原创 Lintcode93 Balanced Binary Tree solution 題解
【題目描述】Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined
2019-02-22 21:35:11
原创 Lintcode89 K Sum solution 題解
【題目描述】Givenndistinct positive integers, integerk(k<=n) and a numbertarget.Findknumbers where sum is target. Calculate ho
2019-02-22 21:35:11
原创 Lintcode93 Balanced Binary Tree solution 題解
【題目描述】Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined
2018-09-11 03:28:42
原创 Lintcode91 Minimum Adjustment Cost solution 題解
【題目描述】Given an integer array, adjust each integers so that the difference of every adjacent integers are not greater tha
2018-09-11 03:28:42
原创 Lintcode91 Minimum Adjustment Cost solution 題解
【題目描述】Given an integer array, adjust each integers so that the difference of every adjacent integers are not greater tha
2018-09-11 03:28:42
原创 Lintcode93 Balanced Binary Tree solution 題解
【題目描述】Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined
2018-09-11 03:28:42
原创 Yahoo Front-end Engineer 電面＋Onsite面經
爲了能夠順利拿到offer，我做了很長時間的準備，在Lincode上刷題，報算法班，然後耗了一個多星期做了一份自己滿意的簡歷。我的努力沒有白費，最後我成功拿到Yahoo的offer，現已入職近半年。我通過內推拿到的面試機會。面試時間是在去年
2018-09-11 03:28:42
2
原创 Microsoft面經
前一段時間我參加了Microsoft的招聘。整個面試的過程很長，歷時兩個多月，和許多優秀的競爭者一起廝殺，最終進入了Microsoft。 Online test 時間非常緊，題量很大。時長90分鐘，前面半個小時問了一些常見的問題，後面一小時
2018-09-11 03:28:42
原创 Lintcode92 Backpack solution 題解
【題目描述】Givennitems with size Ai, an integermdenotes the size of a backpack. How full you can fill this backpack?在n個物品中挑選若
2018-09-11 03:28:16
原创 Lintcode89 K Sum solution 題解
【題目描述】Givenndistinct positive integers, integerk(k<=n) and a numbertarget.Findknumbers where sum is target. Calculate ho
2018-09-11 03:28:15