# Andrew Ng Neural-networks-deep-learning 课程笔记一

Week1 Introduction to Deep Learning Tips:在Andrew Ng的课程中，通常使用列向量构成的矩阵来表示一系列样本，如X.shape=(n_x,m),n_x为特征数，m为样本数 1.Neural Networks Basics（1）Binary classification 二分类问题 二分类问题中，结果为离散的两个值，通常为0,1以“识别图片中是否为猫...

# Leetcode解题笔记(Stack)

Leetcode解题笔记(Stack) * 源码见github https://github.com/Kelvinmao/Leetcode/tree/master/Stack * 2016-07-22更新 94.Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes...

# 287.Find the Duplicate Number

287.Find the Duplicate NumberGiven an array nums containing n + 1 integers where each integer is between 1 and n (inclusive), prove that at least one duplicate number must exist. Assume that there is o...

# STL学习之路(一) deque

std::deque deque (usually pronounced like “deck”) is an irregular acronym of double-ended queue. Double-ended queues are sequence containers with dynamic sizes that can be expanded or contracted on bo...

# Leetcode解题笔记(Stack)

2016-07-22更新 94.Binary Tree Inorder TraversalGiven a binary tree, return the inorder traversal of its nodes’ values.For example: Given binary tree [1,null,2,3], return [1,3,2].题目要求完成二叉树中序遍历，递归解法太简...

# Leetcode解题笔记(Linked List)

2016-07-20更新: 61.Rotate ListGiven a list, rotate the list to the right by k places, where k is non-negative.For example: Given 1->2->3->4->5->NULL and k = 2, return 4->5->1->2->3->NULL.这道题的大意是将元素向右移...

# Leetcode解题笔记(Linked List)

2016-07-17更新:142.Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cycle, return null.给定一个单链表，判断其是否带环，若带环返回环的入口结点，否则返回NULL.判断是否带环，快慢指针法就可以解决问题。要返回环的入口，就显得比...

# Leetcode解题笔记(Linked List)

2016-07-16更新:19.Remove Nth Node From End of List Given a linked list, remove the nth node from the end of list and return its head.For example, Note: Given n will always be valid. Try to do this...

# Leetcode解题笔记(Linked List)

2016-07-15更新160.Intersection of Two Linked Lists Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists: begin to i...

55条 共4页1 2 3 4 下一页 尾页
个人资料
• 访问：69388次
• 积分：1228
• 等级：
• 排名：千里之外
• 原创：55篇
• 转载：0篇
• 译文：0篇
• 评论：1条
我的微信公众号
评论排行
最新评论