算法
文章平均质量分 68
万无引力 WY
何以解忧 唯有专注
展开
-
Search Insert Position算法
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You may assume no duplicates in the array.原创 2017-07-29 22:36:33 · 257 阅读 · 0 评论 -
Two Sum II - Input array is sorted
Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numb原创 2017-08-05 21:43:38 · 204 阅读 · 0 评论 -
Find All Numbers Disappeared in an Array
Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements of [1, n] inclusive that do not appear in this array.原创 2017-08-10 22:44:43 · 191 阅读 · 0 评论 -
Remove Element(去除数组中重复的值)
Given an array and a value, remove all instances of that value in place and return the new length. Do not allocate extra space for another array, you must do this in place with constant memory.原创 2017-07-26 21:34:45 · 707 阅读 · 0 评论 -
Remove Duplicates from Sorted Array
public class Solution { public int removeDuplicates(int[] nums) { if (nums == null || nums.length == 0) { return 0; } int last = 0; for (int i = 1; i <原创 2017-07-26 09:32:27 · 174 阅读 · 0 评论 -
Maximum Product of Three Numbers
Given an integer array, find three numbers whose product is maximum and output the maximum product. 给定一个整数数组,查找三个数字,它们的乘积是最大的,并且输出最大的乘积。 Example 1: Input: [1,2,3] Output: 6 Example 2: Input...原创 2017-08-03 10:23:07 · 259 阅读 · 1 评论 -
Max Consecutive Ones
Given a binary array, find the maximum number of consecutive 1s in this array. 给定一个二进制数组,查找这个数组中连续的1的最大数量。 Example 1: Input: [1,1,0,1,1,1] Output: 3 Explanation: The first two digits or the原创 2017-08-16 21:37:23 · 271 阅读 · 0 评论 -
Maximum Average Subarray I
Given an array consisting of n integers, find the contiguous subarray of given length k that has the maximum average value. And you need to output the maximum average value. 给定一个由n个整数组成的数组,查找给定长度原创 2017-08-02 16:28:45 · 247 阅读 · 0 评论 -
Two Sum算法
①算法描述: Given nums = [2, 7, 11, 15], target = 9, Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1]. 解决方法: 一:使用java for循环,暴力搜索方式public int[] twoSum(int[] nums, int target) { for (int原创 2017-07-24 21:34:22 · 696 阅读 · 1 评论 -
Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. 给定一个数组nums,编写一个函数,在保持非零元素的相对顺序的同时,将所有的0移动到它的末尾。 For example, g原创 2017-08-08 22:49:07 · 215 阅读 · 0 评论 -
Contains Duplicate
Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element原创 2017-08-07 21:57:20 · 236 阅读 · 0 评论 -
最大字段和算法
最大字段和算法: 这个算法在本学期的课程中,已经稍作了解。不过印象不够深刻。今天重新复习一下,加深理解。 最大字段和,无非就是三种情况: ①MAX在左半部分 ②MAX在右半部分 ③MAX在中间 ①②均可以使用递归来解决,情况三也并不是很复杂。先附上代码,然后逐条解释。 public class Solution { public int maxSubArray(int[] n原创 2017-07-31 21:43:40 · 1222 阅读 · 0 评论 -
卷积神经网络总结
深度学习系列~卷积神经网络 漫谈 毕业设计顺利结束,这三个月以来每天都有事做的感觉真的很好,能够专注的去读论文、写代码、写论文,并且毕设期间确实学到了很多东西,尤其是大学四年很少涉及的算法,这几个月通过不断地学习与编码实践,感觉自己的算法能力稍稍提高了些,也对自己未来研究生阶段的学习增添了信心吧。 福利 后台回复"机器学习"可获得电子版西瓜书等资源,回复"深度学习"可获得花书等资源。 简介 本篇文...原创 2019-06-19 19:16:47 · 1080 阅读 · 0 评论