10 2014 档案

LeetCode——Copy List with Random Pointer（带random引用的单链表深拷贝）
摘要：问题： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep copy of the list. 结点的定义如下： /** * Defini... 阅读全文
posted @ 2014-10-15 13:08 苍枫露雨 阅读(716) 评论(0) 推荐(0)
LeetCode——Single Number II（找出数组中只出现一次的数2）
摘要：问题： 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 you implement it with... 阅读全文
posted @ 2014-10-14 15:12 苍枫露雨 阅读(587) 评论(0) 推荐(0)
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 d... 阅读全文
posted @ 2014-10-12 16:40 苍枫露雨 阅读(1653) 评论(0) 推荐(0)
LeetCode——Best Time to Buy and Sell Stock III (股票买卖时机问题3)
摘要：问题： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. 依旧还是那个熟悉的味道，如... 阅读全文
posted @ 2014-10-11 22:42 苍枫露雨 阅读(486) 评论(0) 推荐(0)
LeetCode——Best Time to Buy and Sell Stock II (股票买卖时机问题2)
摘要：问题： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, bu... 阅读全文
posted @ 2014-10-09 21:40 苍枫露雨 阅读(478) 评论(0) 推荐(0)
LeetCode——Best Time to Buy and Sell Stock I (股票买卖时机问题1)
摘要：问题： Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the sto... 阅读全文
posted @ 2014-10-09 21:05 苍枫露雨 阅读(1080) 评论(0) 推荐(0)
LeetCode——Reverse Integer（逆置一个整数）
摘要：问题： Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return –321 Have you thought about this? Here are some good questions to ask before coding. Bonus p... 阅读全文
posted @ 2014-10-07 18:08 苍枫露雨 阅读(657) 评论(0) 推荐(0)
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. 分析： ... 阅读全文
posted @ 2014-10-07 15:39 苍枫露雨 阅读(460) 评论(0) 推荐(0)
LeetCode——Single Number（找出数组中只出现一次的数）
摘要：问题： Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without us... 阅读全文
posted @ 2014-10-07 15:28 苍枫露雨 阅读(449) 评论(0) 推荐(0)
LeetCode——Rotate Image（二维数组顺时针旋转90度）
摘要：问题： You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 分析： 二维数组a[n][n]顺时针旋转90度，要解决这个问题，无疑，第一件事儿就... 阅读全文
posted @ 2014-10-07 15:18 苍枫露雨 阅读(9137) 评论(1) 推荐(2)