Review->Improve - 博客园

2017年8月12日

[GeeksForGeeks] Minimum length unsorted subarray, sorting which makes the array sorted

摘要： Given an array, find the minimum length unsorted subarray. After soring this unsorted subarray, the whole array is sorted. Example, if the input array 阅读全文

posted @ 2017-08-12 13:48 Review->Improve 阅读(191) 评论(0) 推荐(0) 编辑

[GeeksForGeeks] Cyclically rotate an array by one

摘要： Given an array of integers, write a program that cyclically rotates the array by one. Example: given {1,2,3,4,5}, your program should rotate the array 阅读全文

posted @ 2017-08-12 08:01 Review->Improve 阅读(294) 评论(0) 推荐(0) 编辑

2017年8月10日

[GeeksForGeeks] Convert a binary tree into its mirror tree

摘要： Given a binary tree, convert it to its mirror tree. Mirror of a binary tree T is another binary tree M with the left and right children of all non-lea 阅读全文

posted @ 2017-08-10 02:42 Review->Improve 阅读(413) 评论(0) 推荐(0) 编辑

2017年8月9日

[GeeksForGeeks] Swap nodes in a single linked list by changing links

摘要： Given a singly linked list whose nodes contain an integer as their keys. All keys are distinct. Swap the node that has key x with the node that has ke 阅读全文

posted @ 2017-08-09 07:24 Review->Improve 阅读(161) 评论(0) 推荐(0) 编辑

2017年8月8日

[LintCode] Subsets

摘要： Given a set of distinct integers, return all possible subsets. Notice Elements in a subset must be in non-descending order. The solution set must not 阅读全文

posted @ 2017-08-08 13:26 Review->Improve 阅读(234) 评论(0) 推荐(0) 编辑

[Coding Made Simple] Subset Sum Problem

摘要： Given a set of non negative integers and a target value, find if there exists a subset in the given set whose sum is target. Solution 1. Enumerate all 阅读全文

posted @ 2017-08-08 12:50 Review->Improve 阅读(492) 评论(0) 推荐(0) 编辑

[GeeksForGeeks] Shuffle a given array

摘要： Given an array, write a program to generate a random permuation of array elements. This question is also asked as "shuffle a deck of cards" or "random 阅读全文

posted @ 2017-08-08 02:48 Review->Improve 阅读(142) 评论(0) 推荐(0) 编辑

[GeeksForGeeks] Find the maximum depth or height of a tree

摘要： Given a binary tree, find the maximum depth or height of this tree. Solution 1. In order traversal to count the maximum depth 1 import java.util.Linke 阅读全文

posted @ 2017-08-08 02:27 Review->Improve 阅读(224) 评论(0) 推荐(0) 编辑

[GeeksForGeeks] Inorder Predecessor and Successor for a given key in BST

摘要： Given a BST whose keys are integers. Find the inorder successor and predecessor of a given key. In case the given key is not found in the BST, return 阅读全文

posted @ 2017-08-08 02:05 Review->Improve 阅读(393) 评论(0) 推荐(0) 编辑

2017年8月4日

[Coding Made Simple] Matrix Chain Multiplication

摘要： Given some matrices, in what order you would multiply them to minimize cost of multiplication. The following problem formulation is extracted from thi 阅读全文

posted @ 2017-08-04 12:31 Review->Improve 阅读(485) 评论(0) 推荐(0) 编辑

Push your limit!

Tell me and I will forget. Show me and I will remember. Involve me and I will understand!

公告