geeksforgeeks 第5页

leetcode -- Implement strStr() -- KMP难理解，但考得不多，知道就好

ref：http://wiki.jikexueyuan.com/project/kmp-algorithm/define.html参考这个codehttp://www.geeksforgeeks.org

xyqzki·2015-12-08 20:00

关于Tree相关问题总结---重点

inorder(non-descendingorderforBST),postordertraversal(deletetree)的recursive方法还有iterative的方法http://www.geeksforgeeks.org

xyqzki·2015-12-08 10:00

leetcode -- Rotate Array -- 重点

这里要参考http://bookshadow.com/weblog/2015/02/24/leetcode-rotate-array/http://www.geeksforgeeks.org/array-rotation

xyqzki·2015-12-04 15:00

calculate pow(x,n)

Writeaprogramtocalculatepow(x,n)http://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/

xyqzki·2015-11-27 20:00

GeeksforGeeks - Adjacency List邻接矩阵C\C++代码

參考站点： http://www.geeksforgeeks.org/graph-and-its-representations/ 这里写了个类，添加删除图的操作。

·2015-11-13 17:22

Data Structure Binary Tree: Convert a given tree to its Sum Tree

http://www.geeksforgeeks.org/convert-a-given-tree-to-sum-tree/ 1 #include <iostream> 2 #include

·2015-11-13 11:16

Data Structure Binary Tree: Populate Inorder Successor for all nodes

http://www.geeksforgeeks.org/populate-inorder-successor-for-all-nodes/ 1 #include <iostream>

·2015-11-13 11:15

Data Structure Binary Tree: Connect nodes at same level using constant extra space

http://www.geeksforgeeks.org/connect-nodes-at-same-level-with-o1-extra-space/ recursive: 1 #include

·2015-11-13 11:14

Data Structure Binary Tree: Check if a given Binary Tree is SumTree

http://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-sumtree/ 1 #include <iostream>

·2015-11-13 11:14

Data Structure Binary Tree: Construct Tree from given Inorder and Preorder traversals

http://www.geeksforgeeks.org/construct-tree-from-given-inorder-and-preorder-traversal/ 1 #include

·2015-11-13 11:13

Data Structure Binary Tree: Inorder Tree Traversal without recursion and without stack!

http://www.geeksforgeeks.org/inorder-tree-traversal-without-recursion-and-without-stack/ 1 #include

·2015-11-13 11:12

Data Structure Binary Tree: Inorder Tree Traversal without Recursion

http://www.geeksforgeeks.org/inorder-tree-traversal-without-recursion/ 1 #include <iostream>

·2015-11-13 11:11

Data Structure Binary Tree: How to determine if a binary tree is height-balanced?

http://www.geeksforgeeks.org/how-to-determine-if-a-binary-tree-is-balanced/ 1 #include <iostream

·2015-11-13 11:11

Data Structure Binary Tree: Diameter of a Binary Tree

http://www.geeksforgeeks.org/diameter-of-a-binary-tree/ 1 #include <iostream> 2 #include &

·2015-11-13 11:10

Data Structure Binary Tree: Convert an arbitrary Binary Tree to a tree that holds Children Sum Property

http://www.geeksforgeeks.org/convert-an-arbitrary-binary-tree-to-a-tree-that-holds-children-sum-property

·2015-11-13 11:09

Data Structure Binary Tree: Level order traversal in spiral form

http://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/ 1 #include <iostream> 2

·2015-11-13 11:08

Data Structure Binary Tree: Check for Children Sum Property in a Binary Tree

http://www.geeksforgeeks.org/check-for-children-sum-property-in-a-binary-tree/ 1 #include <iostream

·2015-11-13 11:07

Data Structure Stack: Reverse a stack using recursion

http://www.geeksforgeeks.org/reverse-a-stack-using-recursion/ 1 #include <iostream> 2 #include

·2015-11-13 10:02

Data Structure Linked List: Flattening a Linked List

http://www.geeksforgeeks.org/flattening-a-linked-list/ 1 #include <iostream> 2 #include <

·2015-11-13 10:01

Data Structure Linked List: Merge Sort for Linked Lists

http://www.geeksforgeeks.org/merge-sort-for-linked-list/ 1 #include <iostream> 2 #include

·2015-11-13 10:00

Data Structure Linked List: Detect and Remove Loop in a Linked List

http://www.geeksforgeeks.org/detect-and-remove-loop-in-a-linked-list/ 1 #include <iostream>

·2015-11-13 10:59

Data Structure Linked List: Reverse a Linked List in groups of given size

http://www.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/ 1 #include <iostream>

·2015-11-13 10:58

Data Structure Linked List: Write a function to get the intersection point of two Linked Lists.

http://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/ 第一第二个方法比较简单

·2015-11-13 10:58

Data Structure Linked List: Function to check if a singly linked list is palindrome

http://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/ 这里的reverse可以reverse

·2015-11-13 10:57

Data Structure Linked List: Write a function to reverse a linked list

iterative太简单不写了 http://www.geeksforgeeks.org/write-a-function-to-reverse-the-nodes-of-a-linked-list/

·2015-11-13 10:56

Data Structure Array: Move all zeroes to end of array

http://www.geeksforgeeks.org/move-zeroes-end-array/ 1 #include <iostream> 2 #include <vector

·2015-11-13 10:56

Data Structure Array: Find if there is a subarray with 0 sum

http://www.geeksforgeeks.org/find-if-there-is-a-subarray-with-0-sum/ 1 #include <iostream>

·2015-11-13 10:55

Data Structure Array: Given an array of of size n and a number k, find all elements that appear more than n/k times

http://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times

·2015-11-13 10:54

Data Structure Array: Maximum circular subarray sum

http://www.geeksforgeeks.org/maximum-contiguous-circular-sum/ 1 #include <iostream> 2 #include

·2015-11-13 10:53

Data Structure Array: Sort elements by frequency

http://www.geeksforgeeks.org/sort-elements-by-frequency-set-2/ 1 #include <iostream> 2 #include

·2015-11-13 10:53

Data Structure Array: Largest subarray with equal number of 0s and 1s

http://www.geeksforgeeks.org/largest-subarray-with-equal-number-of-0s-and-1s/ 1 #include <iostream

·2015-11-13 10:52

Data Structure Array: Find the two numbers with odd occurrences in an unsorted array

http://www.geeksforgeeks.org/find-the-two-numbers-with-odd-occurences-in-an-unsorted-array/ 1 #include

·2015-11-13 10:51

Data Structure Array: Longest Monotonically Increasing Subsequence Size

http://www.geeksforgeeks.org/longest-monotonically-increasing-subsequence-size-n-log-n/ 1 #include

·2015-11-13 10:50

Data Structure Array: Maximum of all subarrays of size k

http://www.geeksforgeeks.org/maximum-of-all-subarrays-of-size-k/ 1 #include <iostream> 2 #

·2015-11-13 10:50

Data Structure Array: Find the minimum distance between two numbers

http://www.geeksforgeeks.org/find-the-minimum-distance-between-two-numbers/ 1 #include <iostream

·2015-11-13 10:49

Data Structure Array: Given an array arr[], find the maximum j – i such that arr[j] > arr[i]

http://www.geeksforgeeks.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/ 1 #include

·2015-11-13 10:48

Data Structure Array: Maximum sum such that no two elements are adjacent

http://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/ 1 #include <iostream

·2015-11-13 10:47

Data Structure Array: Find the Missing Number

http://www.geeksforgeeks.org/find-the-missing-number/ 1. use sum formula, O(n), O(1) 2. use XOR, O(

·2015-11-13 10:46

Data Structure Array: Program for array rotation

http://www.geeksforgeeks.org/array-rotation/ O(n), O(1) 1 #include <iostream> 2 #include

·2015-11-13 10:46

Data Structure Binary Search Tree: Find k-th smallest element in BST (Order Statistics in BST)

http://www.geeksforgeeks.org/find-k-th-smallest-element-in-bst-order-statistics-in-bst/ 1 #include

·2015-11-13 10:45

Data Structure Binary Tree: Lowest Common Ancestor in a Binary Tree

http://www.geeksforgeeks.org/lowest-common-ancestor-binary-tree-set-1/ 1 #include <iostream>

·2015-11-13 10:44

Data Structure Binary Tree: Print ancestors of a given binary tree node without recursion

http://www.geeksforgeeks.org/print-ancestors-of-a-given-binary-tree-node-without-recursion/ 1 #include

·2015-11-13 10:43

Data Structure Binary Tree: Convert a given Binary Tree to Doubly Linked List

http://www.geeksforgeeks.org/in-place-convert-a-given-binary-tree-to-doubly-linked-list/ 1 #include