日志 | 记忆碎片

2019

04

09

21-Merge Two Sorted Lists

题目Merge two sorted linked lists and return it as a new list. The new list should

2019-04-09 Leetcode

Leetcode

09

121-Best Time to Buy and Sell Stock

题目Say you have an array for which the ith element is the price of a given stock

2019-04-09 Leetcode

Leetcode

09

538-Convert BST to Greater Tree

题目Given a Binary Search Tree (BST), convert it to a Greater Tree such that every

2019-04-09 Leetcode

Leetcode

09

169-Majority Element

题目Given an array of size n, find the majority element. The majority element is t

2019-04-09 Leetcode

Leetcode

08

448-Find All Numbers Disappeared in an Array

题目Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elemen

2019-04-08 Leetcode

Leetcode

08

206-Reverse Linked List

题目Reverse a singly linked list. Example: Input: 1->2->3->4->5->NU

2019-04-08 Leetcode

Leetcode

08

283-Move Zeroes

题目Given an array nums, write a function to move all 0’s to the end of it while m

2019-04-08 Leetcode

Leetcode

08

226-Invert Binary Tree

题目Invert a binary tree. Example: Input: 4 / \ 2 7 / \ / \ 1

2019-04-08 Leetcode

Leetcode

07

136-Single Number

题目Given a non-empty array of integers, every element appears twice except for on

2019-04-07 Leetcode

Leetcode

07

104-Maximum Depth of Binary Tree

题目Given a binary tree, find its maximum depth. The maximum depth is the number o

2019-04-07 Leetcode

Leetcode

07

617-Merge Two Binary Trees

题目Given two binary trees and imagine that when you put one of them to cover the

2019-04-07 Leetcode

Leetcode

07

461-Hamming Distance

题目The Hamming distance between two integers is the number of positions at which

2019-04-07 Leetcode

Leetcode

07

771-Jewels and Stones

题目You’re given strings J representing the types of stones that are jewels, and S

2019-04-07 Leetcode

Leetcode

06

特征工程sklearn基础实践、特征工程数据可视化

数据和特征决定了机器学习的上限,而模型和算法只是逼近这个上限而已。特征工程sklearn实践这里主要以iris数据集为例，展示了数据预处理方法、三大类特征选择

2019-04-06 特征工程

特征工程

05

特征工程实践:泰坦尼克号幸存者预测

泰坦尼克号幸存者预测数据集下载地址:https://www.kaggle.com/c/titanic/data 。本案例主要展示特征工程对数据集的处理方法，模型

2019-04-05 特征工程

特征工程

03

关联分析：Apriori和FPgrowth算法原理

关联分析:频繁项集和关联规则从大规模的数据中发现物品间隐含关系的方法被称为关联分析。关联分析是一种在大规模数据集中寻找有趣关系的任务。关联规则:关联规则是形如X

2019-04-03 推荐系统

推荐系统

03

30

GAN原理、Tensorflow搭建GAN神经网络

GAN原理概述论文:GenerativeAdversarialNets论文地址:https://arxiv.org/pdf/1406.2661.pdf 。 GA

2019-03-30 深度学习原理推导

深度学习原理推导

27

机器学习实战：kaggle房价回归预测实战

项目介绍项目地址:https://www.kaggle.com/c/house-prices-advanced-regression-techniques 。该

2019-03-27 机器学习算法实践

机器学习算法实践