- 博客(2)
- 收藏
- 关注
RSS订阅原创 【题解】Leetcode.318. 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 assume that each word will contain only lower case le
2016-07-30 20:18:35
640
原创 【题解】Leetcode.371. Sum of Two Integers
Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -. Example: Given a = 1 and b = 2, return 3. 题目大意： 不使用+和-操作符计算两int和思路： 位操作模拟2进制运算实现：// 实现 a // 从最右边的位
2016-07-29 21:17:14
727
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人