Tony's Log

Algorithms, Distributed System, Machine Learning
  博客园 :: 首页 :: 新随笔 :: 联系 :: 订阅 :: 管理 ::

随笔分类 -  LeetCode

1 2 3 4 5 ··· 13 下一页

LeetCode 942. DI String Match
摘要：A simple greedy construction procedure: - Fill out the seq of 'I' with 0, 1, 2, 3... - Similarly, for the seq of 'D', fill it out with n, n - 1, n - 2 阅读全文
posted @ 2018-12-18 13:18 Tonix 阅读(133) 评论(0) 推荐(0)

LeetCode 853. Car Fleet
摘要：1AC - Yay! A super cute one : ) Again, simulate & play with it in your mind, and you will get it. Key: for car[i] at its position, it can only pass th 阅读全文
posted @ 2018-06-18 11:58 Tonix 阅读(197) 评论(0) 推荐(0)

775. Global and Local Inversions
摘要：This is a super fun problem to think. Again - let's bring our ultimate tool to start playing with it - DISCRETE THINKING, STEP BY STEP. 1. [3,2] is tr 阅读全文
posted @ 2018-02-02 14:10 Tonix 阅读(92) 评论(0) 推荐(0)

423. Reconstruct Original Digits from English
摘要：A different approach to the problem, besides the popular math solution. 阅读全文
posted @ 2017-03-01 04:57 Tonix 阅读(122) 评论(0) 推荐(0)

LeetCode "525. Contiguous Array" !
摘要：A variation of 'maximum sum of subarray' - using hashmap 阅读全文
posted @ 2017-02-27 11:30 Tonix 阅读(118) 评论(0) 推荐(0)

LeetCode "496. Next Greater Element I" !
摘要：Play it in your mind.. or it may be hard to reach to this intuitive solution... 阅读全文
posted @ 2017-02-13 11:35 Tonix 阅读(139) 评论(0) 推荐(0)

LeetCode "460. LFU Cache" !
摘要：My first try was very close to a final solution .. however, this is a much neater solution: https://discuss.leetcode.com/topic/69436/concise-c-o-1-sol 阅读全文
posted @ 2017-02-12 15:22 Tonix 阅读(104) 评论(0) 推荐(0)

LeetCode "498. Diagonal Traverse"
摘要：Medium? Seriously? Well again, always smart solutions out there: https://discuss.leetcode.com/topic/77889/3-line-python-solution 阅读全文
posted @ 2017-02-10 05:07 Tonix 阅读(197) 评论(0) 推荐(0)

LeetCode "Teemo Attacking"
摘要：Isn't it 'Easy'? 阅读全文
posted @ 2017-02-01 01:31 Tonix 阅读(161) 评论(0) 推荐(0)

LeetCode "501. Find Mode in Binary Search Tree"
摘要：It is a matter of hashmap use. For the follow-up: 阅读全文
posted @ 2017-01-31 08:06 Tonix 阅读(151) 评论(0) 推荐(0)

LeetCode "483. Smallest Good Base" !!
摘要：A more programming-like solution, is to hack the problem from simple: we try each possble base value, and see which 111..11 fits target number - using 阅读全文
posted @ 2017-01-31 07:35 Tonix 阅读(279) 评论(0) 推荐(0)

LeetCode "467. Unique Substrings in Wraparound String" !!
摘要：Check out this brilliant solution:https://discuss.leetcode.com/topic/70658/concise-java-solution-using-dp My first solution was a O(n^2) typical DP bo 阅读全文
posted @ 2017-01-28 15:24 Tonix 阅读(105) 评论(0) 推荐(0)

LeetCode "437. Path Sum III"
摘要：The punch line of this one: sum of leaves: pi..pj = root..pj - root..pi. 阅读全文
posted @ 2017-01-28 14:44 Tonix 阅读(134) 评论(0) 推荐(0)

LeetCode "454. 4Sum II"
摘要：Split it into 2 group of arrays, 2 arrays in each group. Then use hashmap. class Solution { public: int fourSumCount(vector<int>& A, vector<int>& B, v 阅读全文
posted @ 2017-01-27 07:45 Tonix 阅读(168) 评论(0) 推荐(0)

LeetCode "445. Add Two Numbers II"
摘要：A natural stack based solution. Seriously, whey 'Medium'? /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * 阅读全文
posted @ 2017-01-27 06:21 Tonix 阅读(183) 评论(0) 推荐(0)

LeetCode "486. Predict the Winner" !!
摘要：Check this out: https://discuss.leetcode.com/topic/76312/java-1-line-recursion-solution Neat thoughts with neat code. Bravo. Deserve to learn. 阅读全文
posted @ 2017-01-26 14:48 Tonix 阅读(201) 评论(0) 推荐(0)

LeetCode "455. Assign Cookies"
摘要：Simple greedy thought .. satify each kid with minimum qualified cookie, from the least greedy kid.. 阅读全文
posted @ 2017-01-24 12:52 Tonix 阅读(175) 评论(0) 推荐(0)

LeetCode "492. Construct the Rectangle"
摘要：Idea is, among all factors of the int, we pick the two that is the closest pair. And searching from sqrt(area) is a better idea: https://discuss.leetc 阅读全文
posted @ 2017-01-24 11:05 Tonix 阅读(205) 评论(0) 推荐(0)

LeetCode "488. Zuma Game" !
摘要：I prefer shorter code, so this one:https://discuss.leetcode.com/topic/75448/memoization-c-solution Please note: we don't want to be too greedy - despe 阅读全文
posted @ 2017-01-22 12:08 Tonix 阅读(250) 评论(0) 推荐(0)

LeetCode "450. Delete Node in a BST"
摘要：Yes the most concise solution is recursion.https://discuss.leetcode.com/topic/66165/very-concise-c-solution-for-general-binary-tree-not-only-bst Here 阅读全文
posted @ 2017-01-21 15:35 Tonix 阅读(137) 评论(0) 推荐(0)

1 2 3 4 5 ··· 13 下一页