摘要: https://leetcode.com/problems/accounts-merge/description/ 阅读全文
posted @ 2018-05-05 15:04 JTechRoad 阅读(210) 评论(0) 推荐(0) 编辑
摘要: Use array. Use map. 阅读全文
posted @ 2018-05-05 09:13 JTechRoad 阅读(110) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/friend-circles/description/ 阅读全文
posted @ 2018-05-05 09:01 JTechRoad 阅读(111) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/number-of-islands/description/ 阅读全文
posted @ 2018-05-05 08:52 JTechRoad 阅读(90) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/redundant-connection/description/ Use map to do Union Find. 阅读全文
posted @ 2018-05-04 15:43 JTechRoad 阅读(112) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/sort-characters-by-frequency/description/ 阅读全文
posted @ 2018-05-04 15:01 JTechRoad 阅读(108) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/non-overlapping-intervals/description/ Greedy. Sort by (start,-end). Scan from left to right, if we see 2 intervals over 阅读全文
posted @ 2018-05-04 14:55 JTechRoad 阅读(139) 评论(0) 推荐(0) 编辑
摘要: When we see ordering, consider stack. When we process item one by one, but I can't process current item, we move to next item (and that item might dep 阅读全文
posted @ 2018-05-04 14:33 JTechRoad 阅读(148) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/next-greater-element-ii/description/ 阅读全文
posted @ 2018-05-04 14:29 JTechRoad 阅读(125) 评论(0) 推荐(0) 编辑
摘要: https://leetcode.com/problems/next-greater-element-i/description/ 阅读全文
posted @ 2018-05-04 14:16 JTechRoad 阅读(114) 评论(0) 推荐(0) 编辑