- 有哪些排序算法，其中哪些是稳定的？什么是稳定？
排序算法有：冒泡排序、选择排序、插入排序、希尔排序、堆排序、归并排序、快速排序等。其中稳定的是：冒泡排序，选择排序，插入排序和归并排序。稳定指的是：在一个待排序的记录序列中，如果存在有多个相同的关键字记录，若经过排序，这些关键字之间的相对次序保持不变，我们就说这种排序方法是稳定的，否则就是不稳定的。
more >>
Ethan Joe
敲石101下
LeetCode(Dynamic Programming)Unique Paths
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 bottom-right corner of the grid (marked ‘Finish’ in the diagram below).
How many possible unique paths are there?
more >>LeetCode(Dynamic Programming)Jump Game
Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.
Each element in the array represents your maximum jump length at that position.
Determine if you are able to reach the last index.
more >>LeetCode(Sorting&Searching)Search a 2D Matrix II
Search in Rotated Sorted Array
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
Your algorithm’s runtime complexity must be in the order of O(log n).
more >>LeetCode(Sorting&Searching)Search in Rotated Sorted Array
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:
- Integers in each row are sorted in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
LeetCode(Sorting&Searching)Search for a Range
Search for a Range
Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.
Your algorithm’s runtime complexity must be in the order of O(log n).
If the target is not found in the array, return [-1, -1].
LeetCode(Sorting&Searching)Find Peak Element
Find Peak Element
A peak element is an element that is greater than its neighbors.
Given an input array nums, where nums[i] ≠ nums[i+1], find a peak element and return its index.
The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.
You may imagine that nums[-1] = nums[n] = -∞.
LeetCode(Sort&Search)Kth Largest Element in an Array
Kth Largest Element in an Array
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.
more >>LeetCode(Sort&Search)Top K Frequent Elements
Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements.
For example,
Given [1,1,1,2,2,3] and k = 2, return [1,2].
tag:
- LeetCode
- 字符串
- 算法初级
- 面经
- JSP
- JavaWeb
- Design
- Midum
- Array&String
- BackTracking
- Medium
- Dynamic Programming
- Primary
- DP
- medium
- LinkedList
- Math
- Others
- Sort&Search
- Tree
- Sort&Serach
- MVC
- 事务
- 读书笔记
- JVM
- 内存
- 对象
- 垃圾收集
- SwordToOffer
- programming
- 链表
- 二叉树
- 算法
- 快速幂
- 排序
- 二维数组，查找
- 数组
- 链表，排序
- 字符串，算法初级
- Permutation
- 丑数
- 排序，高级排序
- plan
- 逆序对
- 项目记录，C#
- 项目
- 测试功能
- 项目笔记
- 项目记录
- 回溯法
- 树
- 笔试，多益网络
- 动态规划，真题练习
- Programming
- String
- 翻转单词列
- 项目记录，问答社区
- 面试笔试
缺失模块。
1、请确保node版本大于6.2
2、在博客根目录（注意不是yilia根目录）执行以下命令：
npm i hexo-generator-json-content --save
3、在根目录_config.yml里添加配置：
jsonContent:
meta: false
pages: false
posts:
title: true
date: true
path: true
text: false
raw: false
content: false
slug: false
updated: false
comments: false
link: false
permalink: false
excerpt: false
categories: false
tags: true
<br>当一切看起来无济于事的时候，<br>我去看一个石匠敲石头。<br>他一连敲了100次，石头仍然纹丝不动。<br>但他敲击第101次的时候，石头裂为两半。<br>可我知道，让石头裂开的不是那最后一击，<br>而是前面100次敲击的结果。