- 博客(23)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 平心静气，从零开始，急于求成最不可取。
静下心来，最近实在浮躁。应该重新审视一下自己的方向和做事方法，从零开始，好好沉淀。没关系的，职业生涯还没开始，时间这么长，总不会一直渣的，沉下心来，好好积累。加油。耐心积累，认真努力，一切都会好起来。...
2018-09-28 18:12:33
586
2
原创 Leetcode 49 Group Anagrams
Leetcode 49 Group Anagramsclass Solution {public: vector<vector<string>> groupAnagrams(vector<string>& strs) { unordered_map<string,multiset<string>> map;...
2018-09-17 21:47:22
254
原创 Leetcode 48 Rotate Image
Leetcode 48 Rotate Imageclass Solution {public: void rotate(vector<vector<int>>& matrix) { //先转置，再说，ij交换是转置 if(matrix.empty()) return; int row = matrix.size();...
2018-09-17 21:46:35
249
原创 Leetcode 876 Middle of the Linked List
Leetcode 876 Middle of the Linked Liststruct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL){}};class Solution {public: ListNode* middleNode(ListNode* head) {...
2018-09-17 21:41:44
391
原创 Leetcode 206 Reverse linked list
Leetcode 206 Reverse linked liststruct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL){}};class Solution {public: ListNode* reverseList(ListNode* head) { ...
2018-09-17 21:40:47
250
原创 Leetcode 142 Linked List Cycle II
Leetcode 142 Linked List Cycle IIstruct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL){}};class Solution {public: ListNode *detectCycle(ListNode *head) {...
2018-09-17 21:40:05
301
原创 Leetcode 141 Linked List Cycle
Leetcode 141 Linked List Cyclestruct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL){}};class Solution {public: bool hasCycle(ListNode *head) { List...
2018-09-17 21:39:24
182
原创 Leetcode 98 Validate Binary Search Tree
Leetcode 98 Validate Binary Search Tree#include <stack>using namespace std;struct TreeNode{ int val; TreeNode *left,*right; TreeNode(int x):val(x),left(NULL),right(NULL){}};cl...
2018-09-17 21:37:47
202
原创 Leetcode 92 Reverse Linked List II
##Leetcode 92 Reverse Linked List IIstruct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL){}};class Solution {public: ListNode* reverseBetween(ListNode* head,...
2018-09-17 21:35:57
214
原创 还是要做自己喜欢的事情啊～ 好好加油。
加油！！！ 快毕业了，还年轻，觉得自己要仔细思考自己的能力和兴趣所在，仔细思考职业规划和发展。 还是要做自己喜欢的事情，不要再畏畏缩缩。不要怕，也不要悔。 想太多有时候是优点，也很多时候是缺点。...
2018-09-14 23:03:19
540
原创 One Millisecond Face Alignment with an Ensemble of Regression Trees人脸对齐 级联回归树 ERT GBDT
论文摘要本文主要面向使用单幅图像进行人脸对齐的问题。我们展示了如何利用级联回归树，从像素强度（像素灰度值）的稀疏子集中估计人脸关键点的位置，并且取得了很好的预测效果以及完全可实时应用的性能。我们提出了一个基于gradient boosting学习级联回归树，优化平方误差loss，并且能够处理标注不全数据的方法。我们展示了如何使用合适的先验来利用图像数据的结构帮助高效的特征选择。我们同样调研了不...
2018-09-11 17:09:46
5171
2
原创 人脸对齐 face alignment 或 人脸关键点检测
图片来源于网络 人脸对齐基本流程1. 人脸预处理识别：输入图像-》人脸检测-》人脸框图片 归一化：scaling+lighting+enlarging(数据增广）-》归一化后的脸部图像2.shape的初始化1）mean shape 取平均 2）随机采样 randomly sampled shape 3)multiple randomly sampled shape...
2018-09-11 15:41:14
6233
原创 Leetcode 75. Sort Colors
Leetcode 75. Sort Colorsclass Solution {public: void sortColors(vector&lt;int&gt;&amp; nums) { int size = nums.size(); if(size &lt;= 1) return; for(int i = 0;i &lt; size; ...
2018-09-11 09:36:49
146
原创 Leetcode 445. Add Two Numbers II
Leetcode 445. Add Two Numbers IIclass Solution{public:ListNode* addTwoNumbers(ListNode* l1,ListNode* l2) { ListNode* newList = NULL; stack<int> s1; stack<int> s2; wh...
2018-09-10 22:47:02
402
原创 Leetcode 41. First Missing Positive
Leetcode 41. First Missing Positiveclass Solution {public: int firstMissingPositive(vector<int>& nums) { if(nums.empty()) return 1; int size = nums.size(); i...
2018-09-10 22:44:58
206
原创 Leetcode 34 Find First and Last Position of Element in Sorted Array
Leetcode 34 Find First and Last Position of Element in Sorted Arrayclass Solution {public: vector<int> searchRange(vector<int>& nums, int target) { vector<int> re...
2018-09-10 22:43:53
146
原创 Leetcode 33. Search in Rotated Sorted Array
Leetcode 33. Search in Rotated Sorted Arrayclass Solution {public: int search(vector<int>& nums, int target) { //auto pos = std::is_sorted_until(nums.begin(),nums.end()); ...
2018-09-10 22:43:02
128
原创 Leetcode 32 Longest Valid Parentheses
Leetcode 32 Longest Valid Parenthesesclass Solution{public: int longestValidParentheses(string s) { int n = s.length(), result = 0; vector<int> dp(n+1); for(int i = 1;...
2018-09-10 22:42:08
153
原创 Leetcode 24 Swap Nodes in Pairs
//Leetcode 24 Swap Nodes in Pairs#include "header.h"#include <iostream>struct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL) {}};class Solution {public: List...
2018-09-10 22:40:34
134
原创 Leetcode 19 Remove Nth Node From End of List
Leetcode 19 Remove Nth Node From End of Liststruct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL) {}};class Solution {public: ListNode* removeNthFromEnd(ListNode* hea...
2018-09-10 22:39:39
134
原创 Leetcode 154 Find Minimum in Rotated Sorted Array II
//Leetcode 154 Find Minimum in Rotated Sorted Array II#include "header.h"class Solution {public: int findMin(vector<int>& nums) { auto pos = std::is_sorted_until(nums.begin(),...
2018-09-10 22:38:08
125
原创 Leetcode 153 Find Minimum in Rotated Sorted Array
Leetcode 153 Find Minimum in Rotated Sorted Array//Leetcode 153 Find Minimum in Rotated Sorted Arrayclass Solution {public: int findMin(vector<int>& nums) { auto pos = std::i...
2018-09-10 22:37:02
150
原创 Leetcode 148 Sort List
Leetcode 148 Sort List//Leetcode 148 Sort Liststruct ListNode{ int val; ListNode* next; ListNode(int x):val(x),next(NULL) {}};class Solution {public: ListNode* sortList(ListNode* head) ...
2018-09-10 22:33:43
165
Stanford_CS229MachineLearning_AndrewNg
2016-09-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人