- 博客(9)
- 资源 (1)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 leetcode刷题，总结，记录，备忘 119
leetcode119Pascal's Triangle IIGiven an index k, return the kth row of the Pascal's triangle.For example, given k = 3,Return [1,3,3,1].Note:Could you optimize your algorithm to use o
2016-01-24 21:44:24
550
原创 leetcode刷题，总结，记录，备忘 9
leetcode9，Palindrome NumberDetermine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Subscribe to see which companies asked this question数字
2016-01-24 20:39:42
346
原创 leetcode刷题，总结，记录，备忘 328
leetcode328Odd Even Linked ListGiven 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
2016-01-21 20:29:37
1477
原创 leetcode刷题，总结， 记录，备忘326
leetcode326Power of ThreeGiven an integer, write a function to determine if it is a power of three.Follow up:Could you do it without using any loop / recursion?使用递归或者循环是很简单的。class Solu
2016-01-14 20:52:42
272
原创 leetcode刷题，总结，记录，备忘 215
leetcode215Kth Largest Element in an ArrayFind the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For exa
2016-01-12 19:55:36
259
原创 leetcode刷题，总结，记录，备忘 312
leetcode312Burst BalloonsGiven n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you b
2016-01-11 19:48:54
739
原创 leetcode刷题，总结，记录，备忘 102
leetcode102Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tr
2016-01-07 19:11:57
288
原创 leetcode刷题，总结，记录，备忘 241
leetcode241Different Ways to Add ParenthesesGiven a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. Th
2016-01-06 22:36:33
618
原创 leetcode刷题，总结，记录， 备忘 318
leetcode318Maximum Product of Word LengthsGiven 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
2016-01-04 18:49:47
452
请问IVS_SDK_Login登录失败返回错误码为119101305是什么错误
2016-02-29
TA创建的收藏夹 TA关注的收藏夹
TA关注的人