11 梅子黄时_宿于松下

尚未进行身份认证

我要认证

本科毕业于安工大自动化专业,研究生就读于北航控制系。做过战斗机飞行仿真平台,热爱生活,享受写代码的感觉,现于墨迹风云(北京)软件科技发展有限公司从事墨迹天气iOS客户端开发。

等级
TA的排名 11w+

LeetCode——Populating Next Right Pointers in Each Node

题目:Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; }Populate each next pointer to point to its next right node. If there

2015-07-19 16:04:26

LeetCode——Insertion Sort List

题目:Sort a linked list using insertion sort.解答:/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };

2015-07-18 23:08:40

LeetCode——Binary Tree Preorder Traversal

题目:Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].解答:/** * Definition for a binary tree n

2015-07-18 00:31:14

LeetCode——Evaluate Reverse Polish Notation

题目:Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1", "+", "3", "*

2015-07-08 23:15:55

LeetCode——Find Minimum in Rotated Sorted Array

题目:Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate exists in the array.解答

2015-07-08 20:07:07

LeetCode——Container With Most Water

题目:Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two

2015-06-28 00:59:22

LeetCode——Summary Ranges

题目: Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return [“0->2”,”4->5”,”7”].解答:class Solution {public: string numToStr(int n

2015-06-27 20:24:33

LeetCode——Same Tree

题目: Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical and the nodes have the same value.解答:/** * Defi

2015-06-24 23:18:51

LeetCode——Merge Sorted Array

题目:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.Note: You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additio

2015-06-24 23:13:12

LeetCode——Symmetric Tree

题目:Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \3 4 4 3But the following is n

2015-06-23 23:31:28

LeetCode——Binary 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).For example: Given binary tree {3,9,20,#,#,15,7},

2015-06-23 22:46:47

iOS Crash相关转载

iOS Crash文件的解析(一) 本文介绍了:1. Crash文件结构(Process Information(进程信息)、Basic Information、Exception、Thread Backtrace、Thread State、Binary Images)2. 常见的Crash类型(Watchdog timeout、User force-quit、Low Memory termin

2015-06-22 22:58:44

分析iOS Crash文件:符号化iOS Crash文件的3种方法

分析iOS Crash文件:符号化iOS Crash文件的3种方法

2015-06-22 22:44:34

iOS Crash文件格式介绍

iOS Crash文件的解析(一)

2015-06-22 22:41:05

LeetCode——Plus 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.解答:class Solution {public

2015-06-22 01:07:12

LeetCode——Climbing Stairs

题目:You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?解答:class Solution {public: in

2015-06-22 00:22:07

LeetCode——Binary Tree Level Order Traversal

题目: Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \

2015-06-22 00:10:21

LeetCode——Balanced Binary Tree

题目: Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never diffe

2015-06-21 13:26:29

LeetCode——Minimum Depth of Binary Tree

题目: Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.解答:/** * Definition for a binary tree

2015-06-18 13:34:04

LeetCode——Path Sum

题目:Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum.For example: Given the below binary tree and sum

2015-06-17 23:39:41

查看更多

勋章 我的勋章
  • 持之以恒
    持之以恒
    授予每个自然月内发布4篇或4篇以上原创或翻译IT博文的用户。不积跬步无以至千里,不积小流无以成江海,程序人生的精彩需要坚持不懈地积累!