数据结构
文章平均质量分 79
qibobo
这个作者很懒,什么都没留下…
展开
-
web开发中的缓存策略:缓存穿透 缓存失效 缓存并发
缓存穿透原创 2014-11-20 14:55:07 · 2717 阅读 · 0 评论 -
算法:二叉树的前序遍历
Binary Tree Preorder Traversal原创 2014-11-20 15:33:56 · 527 阅读 · 0 评论 -
算法 Valid Parentheses
Given a string containing just the characters '(', ')','{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all valid b原创 2014-11-24 23:16:17 · 523 阅读 · 0 评论 -
算法 Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal to m +n) to hold additional elements from B原创 2014-11-24 23:11:26 · 510 阅读 · 0 评论 -
算法 Search a 2D Matrix
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 from left to right.The first integer of each原创 2014-11-24 23:12:43 · 509 阅读 · 0 评论 -
算法 Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You m原创 2014-11-24 23:14:24 · 559 阅读 · 0 评论 -
算法 二叉树的各种遍历
二叉树的遍历方式基本就是前序遍历,中序遍历,后序遍历和层次遍历。从代码的角度来说,前三种最简单的就是用递归了,代码会非常简洁。但是递归有一个缺陷,就是当二叉树的节点非常多的时候,层次深的递归会不停的进行程序的压栈和出栈操作,效率比较低。这里就不写递归算法了,只写四种遍历的非递归算法。先定义二叉树的节点如下:/** * Definition for binary tree * pub原创 2014-12-15 11:21:42 · 721 阅读 · 0 评论 -
[leetcode]26. Remove Duplicates from Sorted Array
Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with原创 2016-12-08 17:56:25 · 344 阅读 · 0 评论 -
[leetcode]28. Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.java代码public class Solution { public int strStr(String原创 2016-12-08 18:11:11 · 332 阅读 · 0 评论