原创 Best Time to Buy and Sell Stock I II III(C++實現)
// Best Time to Buy and Sell Stock I class Solution { public: int maxProfit(vector<int> &prices) { if(pr
原创 Combinations(c++實現)
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n. For example,If n = 4 and k
原创 nginx上搭建HLS流媒體服務器
轉自:http://blog.csdn.net/cjsafty/article/details/7922849 簡介:HTTP Live Streaming(縮寫是 HLS)是一個由蘋果公司提出的基於HTTP的流媒體 網絡傳輸協議。
原创 Compile ffmpeg for iOS 6, support Simulator & armv7 & armv7s
轉自:http://witcheryne.iteye.com/blog/1734706 In the posts, I will show how to use ffmpeg on iOS. This posts is a
原创 Subsets II(C++實現)
Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a su
原创 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 n
原创 Add Binary
Given two binary strings, return their sum (also a binary string). For example,a = "11"b = "1"Return "100". class So
原创 Merge Sort (C++ 實現)
// Type your C++ code and click the "Run Code" button! // Your code output will be shown on the left. // Click on the
原创 iOS平臺UDID方案比較
轉自:http://www.cocoachina.com/bbs/read.php?tid=144524 蘋果在iOS6中禁用了[UIDevice uniqueIdentifier],在iOS7中又把mac地址的獲取給堵上了。沒
原创 Combination Sum II(c++實現)
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the can
原创 UITableView 修改編輯模式下的切圖
把以下代碼放在點解 “編輯” 按鈕時觸發的方法中。 dispatch_time_t popTime = dispatch_time(DISPATCH_TIME_NOW, 0.001); dispatch_after(
原创 subsets(C++實現)
Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending
原创 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
原创 IOS媒體層
轉自:http://wd397.blog.163.com/blog/static/60860635201281683054319/ 媒體層包含圖形技術、音頻技術和視頻技術,這些技術相互結合就可爲移動設備帶來最好的多媒體體驗,更重要的
原创 Combination Sum(c++實現)
Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate nu