2019年4月1日

Partition Array Into Three Parts With Equal Sum LT1013
摘要： Given an array A of integers, return true if and only if we can partition the array into three non-empty parts with equal sums. Formally, we can parti 阅读全文
posted @ 2019-04-01 05:34 一直走在路上 阅读(265) 评论(0) 推荐(0)
Two Sum IV - Input is a BST LT653
摘要： Given a Binary Search Tree and a target number, return true if there exist two elements in the BST such that their sum is equal to the given target. E 阅读全文
posted @ 2019-04-01 03:47 一直走在路上 阅读(186) 评论(0) 推荐(0)

导航