- 博客(5)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 [2016/07/06] LeetCode / Java - Day 13 -
137. Single Number II Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could y
2016-07-06 13:28:29
529
原创 [2016/07/05] LeetCode / Java - Day 12 -
328. Odd Even Linked List Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes
2016-07-05 12:20:11
422
原创 [2016/07/03] LeetCode / Java - Day 11 -
12. Integer to Roman Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 思路：这道题不难，就是真的，很。。。烦。。。而且需要补充几个规则： 基本数字 Ⅰ、X 、C 中的任何一个、
2016-07-03 11:32:17
418
原创 [2016/07/02] LeetCode / Java - Day 10 -
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
2016-07-02 15:45:54
475
原创 [2016/07/01] LeetCode / Java - Day 09 -
下半年加油~不要问我为啥今天这么早→ → 206. Reverse Linked List Reverse a singly linked list. 思路：逆序链表，呃我一下子就想到了堆栈。。其实这个O(2n)的时间复杂度+O(n)的空间复杂度不太好的。。看了一下别人的程序，昨晚有点头昏，就没有仔细看，大概是循环，然后首尾交换，就是改next关系，而我是直接改的val。
2016-07-01 09:12:49
492
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人