算法
Nixum丶丶
正在学习中
展开
-
对常见排序算法的总结(选择、插入、希尔、归并、快速、堆排序)
1.选择排序首先,第一轮循环,取第一个数,与数组中接下来的数进行比较,找到数组中最小的数,与第一个数交换;第二轮循环,取第二个数,与数组中接下来的数进行比较,找到数组中最小的数,与第二个数交换...大概有N^2/2次比较,N次交换2.插入排序对于数组a[],第一轮循环,i=1,j=i,如果a[j]小于a[j-1],两者值交换,j--,继续判断,直到j=0;第二轮循环,i=2,j=i,如果a[j]小...原创 2018-03-13 21:43:40 · 185 阅读 · 0 评论 -
78. Subsets
Given a set of distinct integers, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: nums = [1,2,3]Output:[ [3], [1], [2...原创 2018-04-25 17:11:41 · 220 阅读 · 0 评论 -
62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked 'Start' in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the bott...原创 2018-04-25 17:20:43 · 228 阅读 · 0 评论 -
64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any...原创 2018-04-25 17:25:55 · 196 阅读 · 0 评论