原创 Leetcode 232. Implement Queue using Stacks
Implement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue.pop() -- R
2020-02-22 20:32:10
原创 Leetcode 274. H-Index
Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute th
2020-02-22 20:32:10
原创 Leetcode 264. Ugly Number II
Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2,
2020-02-22 20:32:10
原创 Leetcode 241. Different Ways to Add Parentheses
Given a string of numbers and operators, return all possible results from computing all the different possible ways t
2020-02-22 20:32:10
1
原创 Leetcode 238. Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product
2020-02-22 20:32:10
原创 Leetcode 263. Ugly Number
Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime fac
2020-02-22 20:32:10
原创 Leetcode 240. Search a 2D Matrix II
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
2020-02-22 20:32:10
原创 Leetcode 235. Lowest Common Ancestor of a Binary Search Tree
Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to
2020-02-22 20:32:10
原创 Leetcode 236. Lowest Common Ancestor of a Binary Tree
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definiti
2020-02-22 20:32:10
原创 Leetcode 239. Sliding Window Maximum
Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very
2020-02-22 20:32:10
原创 Leetcode 242. Valid Anagram
Given two strings s and t, write a function to determine if t is an anagram of s. For example,s = "anagram", t = "na
2020-02-22 20:32:10
原创 Leetcode 234. Palindrome Linked List
Given a singly linked list, determine if it is a palindrome. Follow up: Could you do it in O(n) time and O(1) space?
2020-02-22 20:32:10
1
原创 Leetcode 275. H-Index II
Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm? 接
2020-02-22 20:32:10
原创 Leetcode 237. Delete Node in a Linked List
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Suppose
2020-02-22 20:32:10
原创 【深度學習】使用tensorflow實現AlexNet
轉載註明出處：http://blog.csdn.net/accepthjp/article/details/69999309 AlexNet是2012年ImageNet比賽的冠軍，雖然過去了很長時間，但是作爲深度學習中的經典模型，Alex
2020-02-22 20:32:10