- 博客(52)
- 资源 (36)
- 问答 (1)
- 收藏
- 关注
原创 LeetCode(154) Find Minimum in Rotated Sorted Array II
题目Follow up for “Find Minimum in Rotated Sorted Array”: What if duplicates are allowed?Would this affect the run-time complexity? How and why? Suppose a sorted array is rotated at some pivot unknown
2015-10-31 14:02:03 452
原创 LeetCode(155) Min Stack
题目Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) – Push element x onto stack. pop() – Removes the element on top of the stack. top() – Get th
2015-10-31 13:16:25 436
原创 LeetCode(123) Best Time to Buy and Sell Stock III
题目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.Note: You may not eng
2015-10-30 17:03:26 399
原创 LeetCode(122) Best Time to Buy and Sell Stock II
题目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, buy one a
2015-10-30 16:22:52 521
原创 LeetCode(147) Insertion Sort List
题目Sort a linked list using insertion sort.分析实现链表的插入排序注意:程序入口的特殊输入判断处理!节点的链接处理,避免出现断链! AC代码/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; *
2015-10-27 13:00:33 560
原创 LeetCode(153) Find Minimum in Rotated Sorted Array
题目Total Accepted: 65121 Total Submissions: 190974 Difficulty: Medium 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
2015-10-23 13:29:37 605
原创 LeetCode(150) 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-10-23 13:01:24 512
原创 LeetCode(137) Single Number II
题目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 without using
2015-10-22 13:19:41 499
原创 LeetCode(136) 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 using extra
2015-10-22 12:58:54 595
原创 LeetCode(125) Valid Palindrome
题目Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example, “A man, a plan, a canal: Panama” is a palindrome. “race a car” is not a pal
2015-10-21 13:10:52 447
原创 LeetCode(121) Best Time to Buy and Sell Stock
题目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 stock), de
2015-10-21 12:52:14 574
转载 MakeFile
序makefile文件保存了编译器和连接器的参数选项,还表述了所有源文件之间的关系(源代码文件需要的特定的包含文件,可执行文件要求包含的目标文件模块及库等).创建程序(make程序)首先读取makefile文件,然后再激活编译器,汇编器,资源编译器和连接器以便产生最后的输出,最后输出并生成的通常是可执行文件.创建程序利用内置的推理规则来激活编译器,以便通过对特定CPP文件的编译来产生特定的OBJ文件
2015-10-21 11:34:23 741
转载 HUB、Switch、Router在OSI模型层次信息
序(HUB)集线器工作在局域网(LAN)环境,像网卡一样,应用于OSI参考模型第一层,因此又被称为物理层设备。 Switch交换机工作在OSI第2层数据链路层 Router路由器工作在OSI第3层网络层 OSI模型一共7层,1-7层分别是:物理层 数据链路层 网络层 传输层 会话层 表示层 应用层层次划分OSI将计算机网络体系结构(architecture)划分为以下七层:1、物理层:Phys
2015-10-21 11:24:24 2096
原创 LeetCode(116) 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 i
2015-10-20 13:21:43 441
原创 LeetCode(113) Path Sum II
题目Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.For example: Given the below binary tree and sum = 22,分析本题目与上一题 LeetCode(112) Path Sum虽然类型相同,但是需
2015-10-20 12:54:19 1017
原创 Ubuntu 15.04 Qt5 链接 mysql数据库
序最近在Ubuntu15.04下做一个Linux-服务器-客户端通信项目,用到MySQL数据库。开始的时候,在数据库链接时遇到障碍,查找资料解决。特此记录,分享于此。环境配置系统:Ubuntu 15.04 IDE:QtCreator 数据库:MySQL (在软件中心,安装服务器端以及客户端) MySQL驱动:Qt5链接mysql最新驱动网址如果,刚安装了mysql并没有设置初始root密码,
2015-10-19 20:01:00 2071
原创 LeetCode(114) Flatten Binary Tree to Linked List
题目分析按要求转换二叉树;分析转换要求,发现,新的二叉树是按照原二叉树的先序遍历结果构造的单支二叉树(只有右子树)。发现规则,便容易处理了。得到先序遍历,构造即可。AC代码/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNo
2015-10-19 13:23:55 429
原创 LeetCode(112) 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-10-19 12:53:56 949
转载 Linux防火墙:iptables禁IP与解封IP常用命令
序在Linux服务器被攻击的时候,有的时候会有几个主力IP。如果能拒绝掉这几个IP的攻击的话,会大大减轻服务器的压力,说不定服务器就能恢复正常了。在Linux下封停IP,有封杀网段和封杀单个IP两种形式。一般来说,现在的攻击者不会使用一个网段的IP来攻击(太招摇了),IP一般都是散列的。于是下面就详细说明一下封杀单个IP的命令,和解封单个IP的命令。 在Linux下,使用ipteables来维
2015-10-19 10:12:21 862
原创 LeetCode(109) Convert Sorted List to Binary Search Tree
题目Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.分析给定有序链表,构造平衡的二叉查找树。与上题本质相同,只不过采用了不同的数据结构,本题关键在于准确求取链表节点数,并计算根节点所在位置,正确划分左右子树的子链表。注意:指针处理,
2015-10-18 13:46:05 474
原创 LeetCode(111) 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.分析求二叉树的最小深度:根节点到最近叶子节点的路径长度。同样采用递归的思想:当根
2015-10-18 13:09:02 2098
原创 LeetCode(108) Convert Sorted Array to Binary Search Tree
题目Given an array where elements are sorted in ascending order, convert it to a height balanced BST.分析给定一个有序序列,构造一颗平衡的二叉查找树。思想:序列中值构造根节点,递归,前半序列构造左子树,有伴序列构造右子树。AC代码/** * Definition for a binary tree no
2015-10-17 13:29:08 851
原创 LeetCode(106) Construct Binary Tree from Inorder and Postorder Traversal
题目Given inorder and postorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.Show Tags Show Similar Problems分析跟上一道题同样的道理。AC代码class Soluti
2015-10-17 13:14:33 823
原创 LeetCode(105) Construct Binary Tree from Preorder and Inorder Traversal
题目Given preorder and inorder traversal of a tree, construct the binary tree.Note: You may assume that duplicates do not exist in the tree.分析给定一颗二叉树的前序和中序遍历序列,求该二叉树。我们手动做过很多这样的题目,掌握了其规则~前序遍历第一个元素为树的roo
2015-10-15 15:55:04 889
原创 LeetCode(99) Recover Binary Search Tree
题目Two elements of a binary search tree (BST) are swapped by mistake.Recover the tree without changing its structure.Note: A solution using O(n) space is pretty straight forward. Could you devise a con
2015-10-15 14:45:13 874
原创 LeetCode(110) 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 differ b
2015-10-14 15:02:28 832
原创 LeetCode(107) 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-10-14 14:17:36 488
原创 LeetCode(103) Binary Tree Zigzag Level Order Traversal
题目Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).For example: Given binary tre
2015-10-13 14:47:04 722
原创 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.分析很简单的题目,求二叉树的高度。AC代码/** * Definition fo
2015-10-13 14:27:19 572
原创 LeetCode(102) 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} return its level order traver
2015-10-12 16:45:28 1001
原创 LeetCode(98) Validate Binary Search Tree
题目Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s key. The rig
2015-10-12 16:00:29 504
原创 LeetCode(96) Unique Binary Search Trees
题目Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?For example, Given n = 3, there are a total of 5 unique BST’s. 分析此题与上题本质相同,LeetCode 95 Unique Binary Search T
2015-10-11 15:51:32 947
原创 LeetCode(95) Unique Binary Search Trees II
题目Given n, generate all structurally unique BST’s (binary search trees) that store values 1…n.For example, Given n = 3, your program should return all 5 unique BST’s shown below. confused what “{1,#,
2015-10-11 15:09:01 622
原创 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
2015-10-10 16:05:39 439
原创 LeetCode(119) Pascal's Triangle II
题目Given 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 only O(k) extra space?分析与上题LeetCode 118 Pasca
2015-10-09 21:33:54 562
原创 LeetCode(118) Pascal's Triangle
题目Given numRows, generate the first numRows of Pascal’s triangle.For example, given numRows = 5, Return分析构建数字金字塔,由上图可以清楚的找到规律。该题目可用递归实现!比较简单~AC代码class Solution {public: vector<vector<int>> genera
2015-10-09 21:22:13 518
原创 LeetCode(202) Happy Number
题目Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of
2015-10-09 21:08:25 595
转载 Python网络爬虫(Get、Post抓取方式)
简单的抓取网页import urllib.request url="http://google.cn/" response=urllib.request.urlopen(url) #返回文件对象page=response.read()直接将URL保存为本地文件import urllib.request url="http://www.xxxx.com/1.jpg"urllib
2015-10-09 20:04:24 16951 1
转载 Linux服务器硬件设备信息查看
一、cpu信息cpu信息存储在/proc文件系统的cpuinfo(/proc/cpuinfo)文件里,可以直接查看这个文件以获得cpu信息,所列字段解释如下:processor : 核心编号,如:0,1,2,3等。 vendor_id : 制造商id,如:GenuineIntel cpu family : cpu
2015-10-09 10:49:21 7035
原创 LeetCode(92) Reverse Linked List II
题目Reverse a linked list from position m to n. Do it in-place and in one-pass.For example: Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note: Given m, n satisfy the following
2015-10-08 16:37:06 442
适配器模式(Adepter)C#实现及案例
2013-02-04
各种排序的C++算法实现(插入排序、合并排序、堆排序、快速排序)
2013-01-29
java+jsp+tomcat学生管理系统
2013-01-01
java 绘图板程序
2012-12-31
C++ MFC实现飞机大战游戏
2012-12-04
C语言桌面万年历
2012-12-04
Linux聊天室 -- select && 多线程实现
2015-12-22
Windows下Lex与Yacc配置必备工具
2015-01-22
MinGW开发工具
2015-01-09
lex与Yacc所需flex.exe bison.exe
2015-01-09
Web服务器的java实现
2013-02-15
Ubuntu 15.04 qtcreator打不开,请问有人遇到过吗?
2015-10-16
TA创建的收藏夹 TA关注的收藏夹
TA关注的人