2018年5月30日
*1 Two Sum two pointers(hashmap one scan)
摘要： Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex 阅读全文
posted @ 2018-05-30 05:19 wz30 阅读(132) 评论(0) 推荐(0)
Leetcode problem solving...
摘要： 5/29 611 valid triangle number -- three pointers -> binary search 1 two sum (hashmap --> need index) 5/31 15 3 sum (two pointers, hashset) 8/5 234 pal 阅读全文
posted @ 2018-05-30 03:51 wz30 阅读(102) 评论(0) 推荐(0)
**611. Valid Triangle Number three pointer O(n^3) -> square(binary search larget number smaller than target)
摘要： Given an array consists of non-negative integers, your task is to count the number of triplets chosen from the array that can make triangles if we tak 阅读全文
posted @ 2018-05-30 03:30 wz30 阅读(164) 评论(0) 推荐(0)