原创 js event 屬性
轉載自:http://blog.163.com/duanpeng3@126/blog/static/88543735201053115035512/ [略有修改] event代表事件的狀態,例如觸發event對象的元素、鼠標的位
原创 Leetcode -- Container With Most Water
題目: Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical l
原创 Leetcode -- Longest Palindromic Substring
題目:Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 100
原创 Leetcode -- Remove Nth Node From End of List
題目: Given a linked list, remove the nth node from the end of list and return its head. For example, Given lin
原创 Leetcode -- Swap Nodes in Pairs
題目: Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you s
原创 Leetcode -- Sort List
題目: Sort a linked list in O(n log n) time using constant space complexity. 分析: O(n log n)有歸併排序,快速排序和堆排序。針對鏈表,採用歸
原创 Leetcode -- Remove Duplicates from Sorted List
題目: Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Give
原创 Leetcode:Merge Two Sorted Lists(Importance!)
題目: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together th
原创 BFM算法輪廓--基於文章 A Boundary-Fragment-Model for Object Detection
這篇文章提出根據物體的邊緣檢測物體類別的方法。根據某一策略提取具有辨別能力的邊緣片段(boundary fragments),創建codebook,codebook entries攜帶着物體距心的信息,使用boosting的方法,
原创 Leetcode -- Partition List
題目: Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than
原创 git 首次將本地文件上傳到服務器和git常用命令
1. 在服務器,新建一個文件夾 mkdir matrixwave.git 進入該文件夾 設置文件夾屬性,是多人可訪問的。git init --bare -- shared 2.本地 新建一個文件夾 mkdir matrixwa
原创 Leetcode -- Roman to Integer
題目: Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 羅馬數字
原创 Leetcode -- Rotate List
題目: Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3-
原创 Leetcode -- Longest Common Prefix
題目: Write a function to find the longest common prefix string amongst an array of strings. 分析: 一堆string裏面,找到大家共有的
原创 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