本文翻譯自 Simple Reinforcement Learning in Tensorflow: Part 1 - Two-armed Bandit， 作者是 Arthu...
發(fā)簡信
IP屬地：上海
-
基于tensorflow的最簡單的強(qiáng)化學(xué)習(xí)入門-part1：多臂老虎機(jī)問題 -
美籍華人，我選擇讀書來學(xué)習(xí)進(jìn)步。約每兩周一篇文章，拆解一本書的脈絡(luò)。請放心關(guān)注。
-
[Leetcode] 119. Find first positive
題目 Given an unsorted integer array, find the first missing positive integer. For exampl...
-
[Leetcode] 118. Count and Say
題目 The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 2...
-
[leetcode] 117. Search Insert Position
題目 Given a sorted array and a target value, return the index if the target is found. If...
-
[Leetcode] 116. Reverse Nodes in k-Group
題目 Given a linked list, reverse the nodes of a linked list k at a time and return its m...
-
[Leetcode] 115. 3Sum Closest
題目 Given an array S of n integers, find three integers in S such that the sum is closes...
-
[Leetcode] 114. 4sum
題目 Given an array S of n integers, are there elements a, b, c, and d in S such that a +...
-
[Leetcode] 113. Candy
題目 There are N children standing in a line. Each child is assigned a rating value. You ...
-
[Leetcode] 112. Range Sum Query 2D - Immutable
題目 Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined ...
-
[Leetcode] 111. Range Sum Query - Immutable
題目 Given an integer array nums, find the sum of the elements between indices i and j (i...
-
[Leetcode] 110. Maximal Rectangle
題目 Given a 2D binary matrix filled with 0's and 1's, find the largest rectangle contain...
-
[Leetcode] 109. Largest Rectangle in Histogram題目 Given n non-negative integers representing the histogram's bar height where the widt...
-
[Leetcode] 108. Trapping Rain Water
題目 Given n non-negative integers representing an elevation map where the width of each ...
-
[Leetcode] 107. Container With Most Water
題目 Given n non-negative integers a1, a2, ..., an, where each represents a point at coor...
-
[Leetcode ] 106. Palindrome Number
題目 Determine whether an integer is a palindrome. Do this without extra space. Some hint...
-
105. 兩路合并排序
基本思想 將有n個(gè)元素的序列看成是n個(gè)長度為1的有序子序列，然后兩兩合并子序列，得到n/2個(gè)長度為2或1的有序子序列；再兩兩合并，直到得到一個(gè)長度為n的有序序列時(shí)結(jié)束。 解題之法
-
104. 快速排序
基本思想 對任意給定的序列中某個(gè)元素R，經(jīng)過一趟排序后，將原序列分割成2個(gè)子序列（P(0),P(1),...P(R-1)）和(P(R+1),...,P(n-1)),其中前一個(gè)...
-
103. 冒泡排序
基本思想 第一趟在序列(A[0] ~ A[n-1])中從前往后進(jìn)行相鄰兩個(gè)元素的比較，若后者小，則交換，比較n-1次；第一趟排序結(jié)束，最大元素被交換到A[n-1]中（即沉底）...
-
102. 直接插入排序
基本思想 將序列中第一個(gè)元素作為有序序列，然后將剩下的n-1個(gè)元素按照關(guān)鍵字大小依次插入該有序序列，每插入一個(gè)元素后依然保持該序列有序，經(jīng)過n-1趟排序后，成為有序序列。 解...
