判断是否是栈的弹出序列&&二进制中1的个数

最新推荐文章于 2022-10-26 18:19:20 发布

月已满西楼

最新推荐文章于 2022-10-26 18:19:20 发布

阅读量300

点赞数

文章标签：栈

本文链接：https://blog.csdn.net/gjggj/article/details/75808806

版权

每天练点小程序同时被 2 个专栏收录

38 篇文章 0 订阅

订阅专栏

数据结构

22 篇文章 0 订阅

订阅专栏

判断是否是栈的弹出序列

bool IsPop(char *PopOrder, char *PushOrder,int len)
{
    if (PopOrder == nullptr || PushOrder == nullptr || len <= 0)
        return false;
    bool Possible = false;
    char *PopStart = PopOrder;
    char *PushStart = PushOrder;
    stack<int> pStack;
    while (PopStart - PopOrder < len)
    {
        while (pStack.empty() || pStack.top() != *PopOrder)
        {
            if (PushStart - PushOrder >= len)
                break;
            pStack.push(*PushStart);
            PushStart++;
        }
        if (pStack.top() != *PopOrder)
            break;
        pStack.pop();
        PopStart++;

    }
    if (pStack.empty() && PopStart - PopOrder == len)
            Possible = true;
    return Possible;
}

二进制中一的个数

//#include<iostream>
//#include<stack>
//using namespace std;
//bool IsPop(char *PopOrder, char *PushOrder,int len)
//{
//  if (PopOrder == nullptr || PushOrder == nullptr || len <= 0)
//      return false;
//  bool Possible = false;
//  char *PopStart = PopOrder;
//  char *PushStart = PushOrder;
//  stack<int> pStack;
//  while (PopStart - PopOrder < len)
//  {
//      while (pStack.empty() || pStack.top() != *PopOrder)
//      {
//          if (PushStart - PushOrder >= len)
//              break;
//          pStack.push(*PushStart);
//          PushStart++;
//      }
//      if (pStack.top() != *PopOrder)
//          break;
//      pStack.pop();
//      PopStart++;
//      
//  }
//  if (pStack.empty() && PopStart - PopOrder == len)
//          Possible = true;
//  return Possible;
//}
//int main()
//{
//
//}
#include<iostream>
using namespace std;
int getNum(int n)
{
    int count = 0;
    while (n)
    {
        n &= (n - 1);
        ++count;
    }
    return count;
}
int main()
{
    int n;
    while (cin >> n)
        cout << getNum(n) << endl;
    return 0;
}