E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
LeetCode刷题笔记
【
leetcode刷题笔记
】Rotate Image
You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up:Could you do this in-place? 题解: 如果要原地算法的话,就只能用交换实现了。首先把ma
·
2015-10-30 13:15
LeetCode
【
leetcode刷题笔记
】Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 题解:递归就可以了。 Java代码如下: 1 /** 2 * Definition for binary tree 3 * public class TreeNod
·
2015-10-30 13:14
Binary search
【
leetcode刷题笔记
】Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majori
·
2015-10-30 13:14
LeetCode
【
leetcode刷题笔记
】Find Minimum in Rotated Sorted Array
Suppose a sorted array 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). Find the minimum element. You may assume no duplicate exi
·
2015-10-30 13:14
LeetCode
【
leetcode刷题笔记
】Single Number II
Given an array of integers, every element appears three times except for one. Find that single one. Note:Your algorithm should have a linear runtime complexity. Could you implement it witho
·
2015-10-30 13:13
LeetCode
[
leetcode刷题笔记
]Implement Trie (Prefix Tree)
题目链接 一A,开森~ ac代码: 1 class TrieNode { 2 // Initialize your data structure here. 3 char content; 4 boolean isWord; 5 int count; 6 LinkedList<TrieNode> childList;
·
2015-10-24 09:02
LeetCode
上一页
17
18
19
20
21
22
23
24
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他