Gray Code (Leetcode 89)
PLAY LISTS:
May-2020 Leetcode challenge: • May2020-Leetcode-Challenge
Arrays • Reconstruct a 2-Row Binary Matrix(Leetcode...
Binary Search: • BinarySearch
Easy Problems: • Easy Problems
Medium Problems: • Medium Problems
Hard Problems: • Hard Problems
Divide and Conquer: • Divide and Conquer
Greedy: • Greedy Algorithm
Interview Tips: • Interview Tips
DFS: • DFS
BFS: • BFS
Backtracking: • Playlist
Dynamic Programming: • DynamicProgramming
Queues: • Queues
Design: • Design
Stacks: • Stacks
LinkedList: • LinkedList
Strings: • Strings
Sorting: • Sorting
Tries: • Tries
Graphs: • Graphs
Trees: • Trees
BIT Operations: • BIT operations
netflix, amazon, microsoft, linkedin, apple, google, facebook
Amazon, Microsoft, Google, Facebook, Netflix, Apple
The gray code is a binary numeral system where two successive values differ in only one bit.
Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.
Example 1:
Input: 2
Output: [0,1,3,2]
Explanation:
00 - 0
01 - 1
11 - 3
10 - 2
For a given n, a gray code sequence may not be uniquely defined.
For example, [0,2,3,1] is also a valid gray code sequence.
00 - 0
10 - 2
11 - 3
01 - 1
Example 2:
Input: 0
Output: [0]
Explanation: We define the gray code sequence to begin with 0.
A gray code sequence of n has size = 2n, which for n = 0 the size is 20 = 1.
Therefore, for n = 0 the gray code sequence is [0].
In questa pagina del sito puoi guardare il video online Gray Code (Leetcode 89) della durata di ore minuti seconda in buona qualità , che l'utente ha caricato Coding Interviews 07 giugno 2020, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 2,567 volte e gli è piaciuto 22 spettatori. Buona visione!
