My Leetcode

Friday, June 20, 2014

Permutations (Java)

Given a collection of numbers, return all possible permutations.
For example,
[1,2,3] have the following permutations:
[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].



at June 20, 2014
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest
Labels: DFS, DP, Leetcode, Recursion

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

About Me

Unknown
View my complete profile

Blog Archive

  • ▼  2014 (102)
    • ►  September (1)
    • ►  July (1)
    • ▼  June (12)
      • Generate Parentheses (Java)
      • Climbing Stairs
      • Best Time to Buy and Sell Stock (Java)
      • Unique Paths Java
      • Binary Tree Postorder Traversal (Java)
      • Permutations (Java)
      • Minimum Path Sum (Java)
      • Search a 2D Matrix (Java + Python)
      • Container With Most Water
      • Remove Duplicates from Sorted Array II (Python + J...
      • Spiral Matrix II ( Java + Python)
      • Set Matrix Zeros (Java and Python)
    • ►  May (2)
    • ►  April (2)
    • ►  March (6)
    • ►  February (29)
    • ►  January (49)
  • ►  2013 (13)
    • ►  September (13)

Labels

  • BFS
  • Binary Search
  • DFS
  • Divide and Conquer
  • DP
  • Greedy
  • Helper table
  • Leetcode
  • ListNode
  • Recursion
  • Stack
  • Tree
  • Two Pointers

Report Abuse

Visits Map

Search This Blog

  • Home

Binary Tree Inorder Traversal (Java)

Popular Posts

Simple theme. Powered by Blogger.