摘要：
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving onlydistinctnumbers from the original list.For example,Given1->2->3-... 阅读全文
posted @ 2014-05-06 23:48
Awy
阅读(155)
评论(0)
推荐(0)
摘要：
Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o... 阅读全文
posted @ 2014-05-05 12:18
Awy
阅读(144)
评论(0)
推荐(0)
摘要：
Given two wordsword1andword2, find the minimum number of steps required to convertword1toword2. (each operation is counted as 1 step.)You have the fol... 阅读全文
posted @ 2014-05-04 23:46
Awy
阅读(232)
评论(0)
推荐(0)
摘要：
Sort a linked list using insertion sort.思路：使用插入排序来对链表进行排序。只要注意链表的边界问题，其实关键就是交换链表的值，对链表指针是没有什么影响的。接下来说下具体步骤：1.判断head或者head->next是否为空；2.循环遍历，初始条件pCur=he... 阅读全文
posted @ 2014-05-03 23:27
Awy
阅读(133)
评论(0)
推荐(0)
摘要：
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2]have the following unique perm... 阅读全文
posted @ 2014-05-03 22:45
Awy
阅读(130)
评论(0)
推荐(0)
摘要：
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possibl... 阅读全文
posted @ 2014-05-03 09:27
Awy
阅读(133)
评论(0)
推荐(0)
摘要：
Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"100".思路：一个二进制字符串相加；首先从字符串的末尾开始，先二进制字符转化为数字，然后再相加；然后将... 阅读全文
posted @ 2014-05-03 00:04
Awy
阅读(161)
评论(0)
推荐(0)
摘要：
Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only n... 阅读全文
posted @ 2014-05-02 10:35
Awy
阅读(257)
评论(0)
推荐(0)
摘要：
Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No... 阅读全文
posted @ 2014-05-02 00:23
Awy
阅读(318)
评论(0)
推荐(0)
摘要：
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning ofs... 阅读全文
posted @ 2014-04-30 10:40
Awy
阅读(139)
评论(0)
推荐(0)
摘要：
Given a strings, partitionssuch that every substring of the partition is a palindrome.Return all possible palindrome partitioning ofs.For example, giv... 阅读全文
posted @ 2014-04-29 23:56
Awy
阅读(144)
评论(0)
推荐(0)
摘要：
队列是一种先进先出(FIFO)的线性表，他只允许在表的一端进行插入，而在另一端删除元素。在队列中，允许插入的一端叫做队尾(rear)，允许删除的一端则称为对头(front)。链队列——队列的链式表示和实现 用链表表示的队列简称链队列。一个链队列显然需要两个分别指示对头和队尾的指针才能唯一确定。... 阅读全文
posted @ 2014-04-29 15:34
Awy
阅读(718)
评论(0)
推荐(0)
摘要：
栈是限定仅在表尾进行插入或者删除操作的线性表。因此，对栈来说，表尾端有特殊含义，称为栈顶，表头端为栈底。不含元素的空表称为空栈。栈的主要特点就是后进先出(LIFO);栈的表示和实现 顺序栈，即栈的顺序存储结构是利用一组地址连续的存储单元依次存放自栈底到栈顶的数据元素，同时附设指针top指示栈顶... 阅读全文
posted @ 2014-04-29 09:58
Awy
阅读(1251)
评论(0)
推荐(0)
摘要：
Given preorder and inorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.思路：由前序遍历数组和中序遍历... 阅读全文
posted @ 2014-04-28 10:19
Awy
阅读(144)
评论(0)
推荐(0)
摘要：
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephon... 阅读全文
posted @ 2014-04-28 09:42
Awy
阅读(123)
评论(0)
推荐(0)
摘要：
Given inorder and postorder traversal of a tree, construct the binary tree.Note:You may assume that duplicates do not exist in the tree.思路：从中序遍历和后序遍历的... 阅读全文
posted @ 2014-04-26 19:25
Awy
阅读(150)
评论(0)
推荐(0)
摘要：
Implement pow(x,n).思路：这道题看似简单，其实杀机无穷啊，所以啊在面试的时候，面试官考你一道很简单的问题，要想清楚。这道题我一直RE，就是对n0) return pow_position(x,n); else return ... 阅读全文
posted @ 2014-04-26 16:39
Awy
阅读(146)
评论(0)
推荐(0)
摘要：
Given a collection of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Each number ... 阅读全文
posted @ 2014-04-25 10:54
Awy
阅读(155)
评论(0)
推荐(0)
摘要：
Given a set of candidate numbers (C) and a target number (T), find all unique combinations inCwhere the candidate numbers sums toT.Thesamerepeated num... 阅读全文
posted @ 2014-04-25 10:35
Awy
阅读(126)
评论(0)
推荐(0)
摘要：
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi... 阅读全文
posted @ 2014-04-24 13:48
Awy
阅读(165)
评论(0)
推荐(0)
摘要：
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al... 阅读全文
posted @ 2014-04-24 12:08
Awy
阅读(146)
评论(0)
推荐(0)
摘要：
Givenn, generate all structurally uniqueBST's(binary search trees) that store values 1...n.For example,Givenn= 3, your program should return all 5 uni... 阅读全文
posted @ 2014-04-23 21:29
Awy
阅读(136)
评论(0)
推荐(0)
摘要：
The count-and-say sequence is the sequence of integers beginning as follows:1, 11, 21, 1211, 111221, ...1is read off as"one 1"or11.11is read off as"tw... 阅读全文
posted @ 2014-04-22 17:46
Awy
阅读(204)
评论(0)
推荐(0)
摘要：
Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the fol... 阅读全文
posted @ 2014-04-21 15:18
Awy
阅读(180)
评论(0)
推荐(0)
摘要：
Given an arraySofnintegers, find three integers inSsuch that the sum is closest to a given number, target. Return the sum of the three integers. You m... 阅读全文
posted @ 2014-04-20 23:58
Awy
阅读(174)
评论(0)
推荐(0)
摘要：
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the ord... 阅读全文
posted @ 2014-04-19 11:34
Awy
阅读(180)
评论(0)
推荐(0)
摘要：
Write a function to find the longest common prefix string amongst an array of strings.思路：题目意思是所有字符串的最长公共前缀。首先我们看两个字符串的最长公共前缀，他们的前缀不可能超过最短字符串的长度。所以在这个长... 阅读全文
posted @ 2014-04-19 10:08
Awy
阅读(137)
评论(0)
推荐(0)
摘要：
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.思路：把一个排好序的链表转化为平衡二叉树。这道题主要是递归做法，每次找到中间结点，... 阅读全文
posted @ 2014-04-18 00:24
Awy
阅读(95)
评论(0)
推荐(0)
摘要：
Given a binary tree, flatten it to a linked list in-place.For example,Given 1 / \ 2 5 / \ \ 3 4 6The flattened t... 阅读全文
posted @ 2014-04-17 21:49
Awy
阅读(213)
评论(0)
推荐(0)
摘要：
最近遇到一个问题就是在控制结点上查找nova数据库中 select * from compute_nodes\G;中出现IP地址一直是127.0.0.1不是计算结点的IP，就算修改成计算结点的IP，也还是会刷新为127.0.0.1.猜想肯定是nova配置文件错误或者没有添加哪一项，后来经人指点，... 阅读全文
posted @ 2014-04-16 10:44
Awy
阅读(573)
评论(0)
推荐(0)
浙公网安备 33010602011771号