- 博客(7)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 LeetCode 56. Merge Intervals
Given a collection of intervals, merge all overlapping intervals.For example, Given [1,3],[2,6],[8,10],[15,18], return [1,6],[8,10],[15,18].public List<Interval> merge(List<Interval> intervals) {
2018-01-04 09:42:22
151
原创 LeetCode 91. Decode Ways
A message containing letters from A-Z is being encoded to numbers using the following mapping:'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total number of w
2018-01-03 19:30:43
218
原创 LeetCode 67. Add Binary
Given two binary strings, return their sum (also a binary string).For example, a = “11” b = “1” Return “100”.初始化tmp 每一位和tmp的值相加 tmp / 2为下一轮的tmp tmp % 2为该位应该填上的数 public String addBinary(String a,
2018-01-03 16:15:38
143
原创 LeetCode 54. Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example, Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ] ] You should
2018-01-03 00:43:27
151
原创 LeetCode 48. Rotate Image
You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Note: You have to rotate the image in-place, which means you have to modify the input 2D matrix direct
2018-01-02 21:13:04
147
原创 LeetCode 104. Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.计算二叉树的最大深度，没什么好说的，记录一下 public int m
2018-01-02 16:46:48
130
原创 LeetCode 100. Same Tree
Given two binary trees, write a function to check if they are the same or not.Two binary trees are considered the same if they are structurally identical and the nodes have the same value.Example 1:Inp
2018-01-01 23:45:37
137
空空如也
接入有米广告sdk时遇到空指针报错，求帮忙
2016-09-15
TA创建的收藏夹 TA关注的收藏夹
TA关注的人