原创 迅雷2014校招筆試編程題--求單鏈表的差集
/* 已知集合A和B的元素分別用不含頭結點的單鏈表存儲，函數difference()用於求解集合A與B的差集，並將結果保存在集合A的單鏈表中。 例如，若集合A={5,10,20,15,25,30}，集合B={5,15,35,25}，完成計
2020-02-24 18:53:03
原创 【LeetCode】Construct Binary Tree from Inorder and Postorder Traversal
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right;
2020-02-24 18:53:03
原创 【LeetCode】3Sum Closest
class Solution { public: int threeSumClosest(vector<int> &num, int target) { sort(num.begin(), num.end());
2020-02-24 18:53:03
原创 【LeetCode】Rotate List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(i
2020-02-24 18:53:03
原创 【LeetCode】Remove Element
class Solution { public: int removeElement(int A[], int n, int elem) { int result=0; for(int i=0;i<
2020-02-24 18:53:02
原创 【LeetCode】Symmetric Tree
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right;
2020-02-24 18:53:02
原创 【LeetCode】Container With Most Water
class Solution { public: int maxArea(vector<int> &height) { int start = 0; int end = height.size() - 1; i
2020-02-24 18:53:02
原创 【LeetCode】Same Tree
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right;
2020-02-24 18:53:02
原创 【LeetCode】Search in Rotated Sorted Array II
class Solution { public: bool search(int A[], int n, int target) { int start = 0, end = n; while (st
2020-02-24 18:53:02
原创 美團網2014校招研發筆試哈爾濱站--鏈表翻轉
1、鏈表翻轉。給出一個鏈表和一個數k，比如鏈表1→2→3→4→5→6，k=2， 則翻轉後2→1→4→3→6→5，若k=3,翻轉後3→2→1→6→5→4， 若k=4，翻轉後4→3→2→1→5→6 */ ListNode *reverseK(
2020-02-24 18:53:02
原创 Linux內存分配小結--malloc、brk、mmap
http://blog.163.com/xychenbaihu@yeah/blog/static/132229655201210975312473/ http://blog.sina.com.cn/s/blog_7c60861501015
2020-02-24 18:53:02
原创 【LeetCode】Reorder List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(i
2020-02-24 18:53:02
原创 【LeetCode】Remove Nth Node From End of List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(i
2020-02-24 18:53:02
原创 【LeetCode】Trapping Rain Water
class Solution { public: int trap(int A[], int n) { vector<int> left(n); int maxheight = 0; for (int i =
2020-02-24 18:53:02
原创 互聯網筆試機試經典--楊氏矩陣查找
定位法，時間複雜度O（m+n）。首先直接定位到最右上角的元素，再配以二分查找，比要找的數（6）大就往左走，比要找數（6）的小就往下走，直到找到要找的數字（6）爲止，如下圖所示： //楊氏矩陣查找 int col = 4; int row
2020-02-24 18:53:02