2015年11月_HelloWorld_EE

12月 11月 10月 09月 08月 07月 06月 05月

原创《leetCode》：Sort Colors

题目Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0,

2015-11-29 22:51:23 535

原创《leetCode》：Search a 2D Matrix

题目Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each row i

2015-11-29 21:20:21 552

原创《leetCode》：Set Matrix Zeroes

题目Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.Follow up:Did you use extra space?A straight forward solution using O(mn) space is probably a bad idea.

2015-11-29 21:05:09 462

原创《leetCode》：Simplify Path

题目Given an absolute path for a file (Unix-style), simplify it.For example,path = "/home/", => "/home"path = "/a/./b/../../c/", => "/c"Corner Cases:Did you consider the case where path = "/../"?In t

2015-11-29 20:19:15 564

原创《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?题目大意：每步只能爬一个或者是两个台阶，爬到顶端n个台阶有多少中方法？

2015-11-29 17:20:53 538

原创《leetCode》：Valid Number

题目Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false"1 a" => false"2e10" => trueNote: It is intended for the problem statement to be ambiguous. You shoul

2015-11-29 16:08:28 594

原创《leetCode》：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 co

2015-11-26 21:14:02 437

原创《leetCode》：Search in Rotated Sorted Array II

题目Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the array.题

2015-11-26 19:13:22 504

原创从字节码的角度来看try-catch-finally和return的执行顺序

从字节码的角度来看try-catch-finally和return的执行顺序全篇以一个例子来说明：先看如下代码：public class ExceptionTest { public void testException(){ try{ //调用一个抛异常的函数 inside_try(); } c

2015-11-25 22:47:40 2594 1

原创《leetCode》：Linked List Cycle II

题目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 extra space?题目大意：若链表中存在环，则

2015-11-25 21:15:06 547

原创《leetCode》：Linked List Cycle

题目Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?题目大意：不能用额外的空间来判断一个链表是否有环。思路如果一个链表存在环，当我遍历这个链表时，将我们遍历过的每个节点进行标记，如果被标记的节点又被遍历到的时候就出现了环，基于这样的

2015-11-25 20:26:23 478

原创《leetCode》：Search 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).You are given a target value to search. If found in the array return its ind

2015-11-24 20:42:35 498

原创《leetCode》：Remove Duplicates from Sorted List

题目Given a sorted linked list, delete all duplicates such that each element appear only once.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, return 1->2->3.题目大意：将所有不同的节点连接起来，即每个节点仅出现一次，去除多

2015-11-24 19:52:34 492

原创《leetCode》：Remove Duplicates from Sorted List II

题目Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.For example,Given 1->2->3->3->4->4->5, return 1->2->5.Given 1->1->1->2

2015-11-24 19:37:28 523

原创《leetCode》：Minimum Path Sum

题目Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at a

2015-11-22 22:09:40 467

原创《leetCode》：Unique Paths II

题目描述Follow up for "Unique Paths":Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.Fo

2015-11-22 20:51:23 475

原创《leetCode》：Unique Paths

题目A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bot

2015-11-22 20:08:36 479

原创《leetCode》：Add Binary

题目Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100".题目大意：将两个字符串代表的二进制数进行相加运算。思路此题也是相当简单的题，直接进行相加就可以了，值得注意的是：两个代表二进制数字的字符相加应该这样：(下面这个错误：自己在做这个题

2015-11-22 19:35:05 451

原创《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.题目大意：将用数组表示的一个数进行加1操作。其中数组的

2015-11-22 18:47:01 470

原创《leetCode》：Permutation Sequence

题目描述The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence (ie, for n = 3):"123""132""213""231""312"

2015-11-22 17:39:59 447

原创《leetCode》：Insert Interval

题目Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Example

2015-11-21 22:46:34 472

原创《leetCode》：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].题目大意：将有重叠间隔的区域的进行合并。思路此题也比较简单。先将数组intervals按start进行排序，然后再来合

2015-11-21 21:09:41 448

原创《leetCode》：Spiral Matrix II

题目Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6,

2015-11-21 20:27:24 409

原创《leetCode》：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

2015-11-21 19:57:19 465

原创《自己建的第一个网站》

自己的第一个网站背景哥哥正在筹划作为甘肃省兴家铝材在陇南市的总代理，也作为山东省凯米特铝型材在陇南市西和县的总代理。因此，咨询我可不可以给他做一个网站作为他宣传所用？作为程序员的我虽然以前没有接触过做网站，但是我知道做一个简单的网站还是比较简单的，因此，我就一口答应了。筹备答应哥哥的事，不敢怠慢，因此比较用心，头一天晚上，根据自己查的关于建一个个人网站的资料开始一步一步的来做。具体步骤如下：买域名

2015-11-21 16:15:33 1072 2

原创《leetCode》：Jump Game II

题目Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is to re

2015-11-17 21:28:36 453

原创《leetCode》：Jump Game

2015-11-17 20:54:57 375

原创《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-11-16 21:55:25 438

原创《leetCode》：N-Queens II

题目Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of distinct solutions.题目大意：返回N-Queens的总数。思路思路与上篇博文的思路一样。实现代码如下：#include<stdio.h>#include<stdlib.h

2015-11-16 21:38:14 451

原创《leetCode》：N-Queens（奇葩的测试平台，居然不能AC）

题目The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle.Each s

2015-11-16 20:50:22 579

原创《leetCode》：Count Primes

题目Description:Count the number of prime numbers less than a non-negative number, n.题目大意：统计小于n的素数的个数质数（prime number）又称素数，有无限个。一个大于1的自然数，除了1和它本身外，不能被其他自然数整除，换句话说就是该数除了1和它本身以外不再有其他的因数；否则称为合数。根据算术基本定理，

2015-11-16 19:24:36 530

原创《leetCode》：Median of Two Sorted Arrays

题目There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).思路一：边界太多，没有调出来思路：由于题目对时间复杂

2015-11-15 17:11:08 471

原创 Django中块标签for endfor的使用

Django中块标签for endfor的使用对于一个list数据类型，如果不使用for块标签，则访问list中的元素则实现代码如下： <h1>book_list:{{book_list}}</h1> <li>{{book_list.0}}</li> <li>{{book_list.1}}</li> <li>{{book_list.2

2015-11-14 22:23:51 3888 4

原创 Django块标签if else 配合not and or的使用

Django块标签if else 配合not and or的使用模板文件index1.html中的代码如下：<html lang="en"> <head> <meta charset="UTF-8"> <title>wuranghao</title> </head> <body> <h1>hello:{{user.name}}</h1> <

2015-11-14 22:03:57 10436

原创在Django块标签中遇到的Error：Could not parse the remainder:'>' from 'user.age>'

在学习模板的块标签的使用的第一个例子中，就出现了这个错误。出错时的代码是这样写的： index.html<html lang="en"> <head> <meta charset="UTF-8"> <title>wuranghao</title> </head> <body> <h1>hello:{{user.name}}</h1> <h1>

2015-11-14 21:49:17 16063 2

原创《Django》中模板接收到的几种数据类型

第一种：接收普通的基本数据类型接收基本数据类型，views.py中通过赋值的方式传送给模板文件，例子如下：模板文件index.html代码如下<html lang="en"> <head> <meta charset="UTF-8"> <title>{{title}}</title> </head> <body> <h1>hello ,worl

2015-11-14 20:57:57 3882

原创《Django学习》遇到的问题：“TypeError：'str' object is not callable"

今天星期六，躺在床上，准备想着自己是不是应该了解下python的web框架，于是，就开始鼓捣Django。在开始第一个程序：hello，world时，刚开始挺顺利，但是，在我启动内部服务器之后，在浏览器键入http://127.0.0.1:8000/blog/index/原以为，出现在自己眼前的将是”hello,world”,但是，实际上，并没有出现，而是出现了一个报错页面。如下：出现问题了，肯

2015-11-14 19:26:43 4319

原创《leetCode》：Sqrt(x)----------hard

题目Implement int sqrt(int x).Compute and return the square root of x.思路一：报超时错误这个是我看到这个题的第一反应：从1~x/2，找到第一个数的平方大于x的前一个数即为所求，相信很多的朋友都想我一样，第一反应就是这样一个思路，这种思路错是没有错，但是效率低下。报超时错误代码如下：int mySqrt(int x) { if(

2015-11-13 21:24:51 432

原创《leetCode》：Maximum Subarray

题目Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1,−5,4],the contiguous subarray [4,−1,2,1] has th

2015-11-13 21:06:21 426

原创《leetCode》：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 ugly while 14 is not ugly since it

2015-11-13 20:31:24 398