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 | 251 Views, 22799 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 | 251 Views, 22799 Search Bots | 38 Words Subscribe to Feed Burner

Related Articles

  1. Making a Height Balanced Binary Search Tree
  2. Absolute Path
  3. Find the non-duplicate number
  4. Daily Interview Puzzle: Minimum Size Subarray Sum
  5. Invert a Binary Tree
  6. ImageMagick Vulnerabilities -  CVE-2016–3714
  7. Daily Interview Problem: Queue Using Two Stacks
  8. Daily Interview Problem: Decode String
  9. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  10. Reverse a Linked List

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="index, follow">