Tony's Log

Algorithms, Distributed System, Machine Learning

:: :: :: :: :: ::

:: ::

公告

2015年12月17日

LeetCode "Maximum Product of Word Lengths"

摘要： Another O(n^2) solution using bit ops. We prune 1/2(expected) candidates at each bit check.#define MAX_BITS 1600typedef bitset CandMask;class Solution... 阅读全文

posted @ 2015-12-17 04:16 Tonix 阅读(258) 评论(0) 推荐(0)