weidagang

/*
Problem

Implement a circular queue of integers of user-specified size using a simple array. 
Provide routines to initialize(), enqueue() and dequeue() the queue. Make it thread safe. 
Please implement this with your own code and do not use any class libraries or library calls.
*/

#include <malloc.h>

weidagang

#include <cstdio>
#include <cstring>
#include <memory>
#include <algorithm>

#define N 1000
#define OK 0
#define ERROR 1

struct Node {

weidagang

/*
Given a string of characters, print its permutations in alphbetic order. 
Sample input: bbjd; 
Sample output: bbdj, bbjd, bdbj, ..., jbdb, jdbb
*/

#include <iostream>
#include <string>
#include <algorithm>

weidagang

#include<map>
#include<string>
#include<iostream>
#include<cassert>

typedef std::map<int, std::string> Map;

int main() {
    Map m;
    Map::iterator it;

weidagang

//============================================================================
// Name        : trie.cpp
// Author      : dagang.wei
// Version     :
// Copyright   : 
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <algorithm>
#include <string>

weidagang

/*
http://oj.leetcode.com/problems/largest-rectangle-in-histogram/

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1,
find the area of largest rectangle in the histogram.
*/

class Solution {
    private:
        struct Record {

weidagang

#! /bin/bash

PROCS=(zygote installd keystore mediaserver netd powerbtnd servicemanager ueventd vold)
OUT=/android/data/system/android_pmap.txt

rm -f $OUT

date >> $OUT

echo  cat  /sys/fs/cgroup/memory/android-start/memory.limit_in_bytes  >> $OUT

weidagang

struct Node {
    int m_value;
    int m_row;
    int m_column;
 
    Node() {
    }
 
    Node(int value, int row, int column) {
        m_value = value;

weidagang

# Generate image by: dot -Tpng -o probability_tree.png probability_tree.dot

digraph probability_tree {
    s [label=""]
    male [label="男"]
    female [label="女"]
    y1 [label="穿凉鞋"]
    y2 [label="穿凉鞋"]
    n1 [label="不穿凉鞋"]
    n2 [label="不穿凉鞋"]

weidagang

#include <iostream>

template<int N, int M> 
struct Pow {
    enum { value = N * Pow<N, M-1>::value };
};

template<int N>
struct Pow<N, 0> {
    enum { value = 1 };