To the Top
File:  root - text - article - 2020 - 01 - permutations-of-numbers.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 244 Views, 22050 Search Bots | 38 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Facebook:

You are given an array of integers. Return all the permutations of this array.


def permute(nums):
# Fill this in.

print permute([1, 2, 3])
# [[1, 2, 3], [2, 1, 3], [2, 3, 1], [1, 3, 2], [3, 1, 2], [3, 2, 1]]
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 244 Views, 22050 Search Bots | 38 Words Subscribe to Feed Burner

Related Articles

  1. Most Frequent Subtree Sum
  2. ImageMagick Vulnerabilities -  CVE-2016–3714
  3. Daily Interview Problem: Sort Colors
  4. Plus One
  5. Two Tricks of Delphi
  6. Daily Interview Puzzle: Intersection of Linked Lists
  7. Making a Height Balanced Binary Search Tree
  8. Delphi Dynamic Array
  9. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  10. Algorithm Interview: Subarray With Target Sum

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />