zoukankan      html  css  js  c++  java
  • LeetCode: Gray Code

    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.

    For example, given n = 2, return [0,1,3,2]. Its gray code sequence is:

    00 - 0
    01 - 1
    11 - 3
    10 - 2
    

    Note:
    For a given n, a gray code sequence is not uniquely defined.

    For example, [0,2,3,1] is also a valid gray code sequence according to the above definition.

    For now, the judge is able to judge based on one instance of gray code sequence. Sorry about that.

    class Solution {
    public:
        vector<int> grayCode(int n) {
            std::vector<int> result;
                result.push_back(0);
                for (int i = 0; i < n; ++i)
                {
                    int adder = 1 << i;
                    int len = result.size();
                    for (int i = len -1 ; i >= 0; --i)
                    {
                        int element = result[i] + adder;
                        result.push_back(element);
                    }
                }
            return result;
        }
    };
  • 相关阅读:
    React 使用链表遍历组件树
    React diff 算法
    JavaScript 对象操作
    前端路由hash
    动画运动曲线
    ajax跨域问题
    js版本状态模式
    装饰者模式AOP
    swipe源码循环索引
    组合模式--超级宏命令
  • 原文地址:https://www.cnblogs.com/yeek/p/3990786.html
Copyright © 2011-2022 走看看