- 博客(16)
- 资源 (1)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 leetcode刷题，总结，记录，备忘 198
leetcode198House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each o
2015-09-28 19:54:05
313
原创 leetcode刷题，总结，记录，备忘 118
leetcode118Pascal's Triangle Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,
2015-09-23 20:06:56
407
原创 leetcode刷题，总结，记录，备忘 225
leetcode225Implement Stack using Queues Implement the following operations of a stack using queues. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top()
2015-09-21 22:04:19
246
原创 leetcode刷题，总结，记录，备忘 283
leetcode283Move Zeroes Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1,
2015-09-20 13:09:24
294
原创 leetcode刷题，总结，记录，备忘66
leetcode66Plus One Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list.
2015-09-18 22:42:10
262
原创 leetcode刷题，总结，记录，备忘 129
leetcode129Sum Root to Leaf Numbers Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which re
2015-09-17 19:45:30
519
原创 leetcode刷题， 总结，记录， 备忘 230
leetcode230Kth Smallest Element in a BST Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BS
2015-09-16 19:20:26
509
原创 leetcode刷题，总结，记录，备忘 263
leetcode263 Ugly Number Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are u
2015-09-15 19:16:06
273
原创 leetcode刷题，总结，记录，备忘 231
leetcode231 Power of Two Given an integer, write a function to determine if it is a power of two.class Solution { public: bool isPowerOfTwo(int n) { if (n == 0) { retu
2015-09-14 20:54:56
256
原创 leetcode刷题，总结，记录，备忘 77
leetcode77Combinations Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example, If n = 4 and k = 2, a solution is: [ [2,4], [3,4], [2,3],
2015-09-13 20:08:43
279
原创 leetcode刷题，总结，记录，备忘 107
leetcode107Binary Tree Level Order Traversal II Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
2015-09-12 13:21:24
1147
原创 leetcode刷题， 总结，记录， 备忘142
leetcode142 Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Note: Do not modify the linked list. Follow up: Can you solve it without using ext
2015-09-08 21:58:18
424
原创 leetcode刷题，总结，记录，备忘 117
leetcode117 Populating Next Right Pointers in Each Node II Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would y
2015-09-06 19:35:11
526
原创 leetcode刷题，总结，记录，备忘235
leetcode235 Lowest Common Ancestor of a Binary Search Tree Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the defin
2015-09-05 20:27:28
319
原创 leetcode刷题，总结，记录，备忘 260
leetcode260 Single Number III Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that
2015-09-04 23:16:33
323
原创 leetcode刷题，总结，记录，备忘 258
leetcode258 Add Digits Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example: Given num = 38, the process is like: 3 +
2015-09-01 19:01:46
306
请问IVS_SDK_Login登录失败返回错误码为119101305是什么错误
2016-02-29
TA创建的收藏夹 TA关注的收藏夹
TA关注的人