原创 LeetCode:Edit Distance
Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2.(each operation is
原创 LeetCode:Is Subsequence
Given a string s and a string t, check if s is subsequence of t. You may assume that there is only lower case English
原创 LeetCode: Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the no
原创 LeetCode:Single Number
Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm s
原创 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 origin
原创 進程間通信、線程間通信的各種方式
操作系統的主要任務是管理計算機的軟件、硬件資源。現代操作系統的主要特點是多用戶和多任務,也就是程序的並行執行,windows如此linux也是如此。
原创 LeetCode: Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new
原创 LeetCode: Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements. For example, Given [1,1,1,2,2,3] and k = 2,
原创 LeetCode:Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1. Some courses may have prerequisites, for e
原创 http中Post、Get方式的區別
簡單理解,http中定義了客戶端與服務器交互的幾種方式,常見的有get和post get和post有兩個主要的不同: 1、get是從服務器上獲取數據,而post則是向服務器傳送數據 2、get將表單中的參數按照var=value的形式,
原创 淺析RPC遠程過程調用基本原理
在校期間大家都寫過不少程序,比如寫個hello world服務類,然後本地調用下,如下所示。這些程序的特點是服務消費方和服務提供方是本地調用關係。而
原创 LeetCode:Reorder List
Given a singly linked list L : L0 -> L1 -> ...Ln-1 -> Ln, reorder it to: L0 -> Ln ->L1 ->Ln-1 -> L2 -> Ln-2 ->.... You
原创 LeetCode:Rotate Image
You are given an n*n 2D matrix representing an image. Rotate the image by 90 degrees(clockwise). Follow up: Could you d
原创 MySQL常見存儲引擎對比
爲什麼數據庫通常都有多種不同的存儲引擎可以選用?數據庫的存儲引擎到底是什麼東西?不同存儲引擎的特點有什麼區別? 在數據庫表的設計過程中,可以發現有的表較爲簡單,有的表較爲複雜,甚至有的表根本不用來存儲任何長期的數據,有的表讀取時非常快,但
原创 LeetCode: Subtree of Another Tree
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a