数据结构与算法
peterkang202
这个作者很懒,什么都没留下…
展开
-
java 数组初始化之后的值
1.数组元素的类型是基本类型中的整数类型(byte、short、int和long),则数组元素的值是0。2.数组元素的类型是基本类型中的浮点类型(float、double),则数组元素的值是0.0。3.数组元素的类型是基本类型中的字符类型(char),则数组元素的值是'\u0000'。4.数组元素的类型是基本类型中的布尔类型(boolean),则数组元素的值是fal转载 2015-03-30 15:32:57 · 914 阅读 · 0 评论 -
N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle.原创 2015-06-10 10:00:10 · 415 阅读 · 0 评论 -
leetcode: Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \ 9 20 / \原创 2015-05-15 11:13:50 · 337 阅读 · 0 评论 -
leetcode:two sum的三种解法
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where in原创 2015-04-15 20:16:13 · 5484 阅读 · 0 评论 -
leetcode: Isomorphic Strings
class Solution {public: bool isIsomorphic(string s, string t) { if(s.empty() && t.empty()) return true; int sl = s.length(); int tl = t.length(); char *原创 2015-05-16 10:28:56 · 423 阅读 · 0 评论 -
LeetCode:Reorder List C++与Java实现
LeetCode:Reorder List题目(题目链接):Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,G原创 2013-11-18 22:53:38 · 1120 阅读 · 0 评论 -
leetcode: count and say
The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2, the原创 2015-05-14 17:56:31 · 360 阅读 · 0 评论 -
n个不同元素进栈,出站序列个数
卡兰特数原创 2015-04-14 09:50:40 · 3971 阅读 · 0 评论 -
二叉树后序排序的非递归算法
转自http://www.cnblogs.com/ybwang/archive/2011/10/04/lastOrderTraverse.html前序、中序、后序的非递归遍历中,要数后序最为麻烦,如果只在栈中保留指向结点的指针,那是不够的,必须有一些额外的信息存放在栈中。方法有很多,这里只举一种,先定义栈结点的数据结构typedef struct{ Node * p; int rvis转载 2015-04-18 17:47:07 · 634 阅读 · 0 评论 -
单链表原地逆置
将带头结点的单链表原地逆置,空间复杂度为O(1) 分析:操作分两步,节点的删除和插入,注意删除节点的保存。LinkList Reverse_1(linkList &L){ LNode *p = L; LNode *q = null; while(p->next!=null){ q = p->next;//要删除的节点 p->next = q-原创 2015-03-31 21:00:55 · 1249 阅读 · 0 评论 -
合并两个有序数组
public static int [] mergeSort(int A[],int B[]){ int i = 0; int j = 0; int k = 0; int []C = new int[A.length+B.length]; while (i<A.length&&j<B.length){原创 2015-03-30 20:30:53 · 367 阅读 · 0 评论