2016 年 1月 2 日随笔档案 - neverlandly

2016年1月2日

Leetcode: Range Sum Query - Mutable && Summary: Segment Tree

摘要： Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.The update(i, val) function modifies nums by upda... 阅读全文

posted @ 2016-01-02 13:48 neverlandly 阅读(493) 评论(0) 推荐(0)

Leetcode: Create Maximum Number

摘要： Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k 0 && n-i-1>=count-j && res[j-1]arr2... 阅读全文

posted @ 2016-01-02 10:17 neverlandly 阅读(2969) 评论(0) 推荐(0)

Leetcode: Maximum Product of Word Lengths

摘要： Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assum... 阅读全文

posted @ 2016-01-02 07:13 neverlandly 阅读(501) 评论(0) 推荐(0)

Leetcode: Shortest Distance from All Buildings

摘要： Adopted approach: start from each building, try to reach all 0. Alternertive approch can be start from each 0, try to reach all buildings. Which is wa 阅读全文

posted @ 2016-01-02 05:53 neverlandly 阅读(3222) 评论(0) 推荐(0)

Leetcode: Remove Duplicate Letters

摘要： Given a string which contains only lowercase letters, remove duplicate letters so that every letter appear once and only once. You must make sure your... 阅读全文

posted @ 2016-01-02 02:18 neverlandly 阅读(952) 评论(0) 推荐(0)