Welcome to MDGSF's Blog!

This is my github blog

[Lua-pil] 八皇后

2017-07-25

mdgsf

lua

Lua

读书笔记： Programming in Lua, 4th Edition.

N = 8  -- board size

-- check whether position (n,c) is free from attacks
function isplaceok(a , n , c)
    for i = 1, n - 1 do
        if (a[i] == c) or
           (a[i] - i == c - n) or
           (a[i] + i == c + n) then
            return false --place can be attacked
        end
    end
    return true --no attacks; place is ok
end

-- print a board
function printsolution( a )
    for i = 1, N do
        for j = 1, N do
            io.write(a[i] == j and "X" or "-", " ")
        end
        io.write("\n")
    end
    io.write("\n")
end

-- add to board 'a' all queens from 'n' to 'N'
function addqueen( a, n )
    if n > N then
        printsolution(a)
    else
        for c = 1, N do
            if isplaceok(a, n, c) then
                a[n] = c
                addqueen(a, n + 1)
            end
        end
    end
end

addqueen({}, 1)

Read All

[Lua-pil] 注释

2017-07-25

mdgsf

lua

Lua

单行注释用 –

多行注释用 –[[]]

Read All
[Lua-pil] 编译源码

2017-07-25

mdgsf

lua

Lua

介绍

官网地址：

http://www.lua.org/home.html

Lua是脚本语言，可以自己运行，可以嵌入C语言运行，也可以把C语言嵌入Lua运行。

Lua全部都是用C语言实现的，可以到官网去下载源码，自己编译，编译过程很简单，没什么错误。

源码目录结构：

编译源码

需要在VS中新建一个VC++解决方案，在该解决方案下建3个项目，分别是lua库项目，lua编译器项目，lua解释器项目。

Lua53 是库项目，生成Lua53.lib。

Lua 是解释器项目，生成Lua.exe。

Luac 是编译器项目，生成Luac.exe。

最终要生成的文件如下：

建立Lua53项目

打开VS2013(其他版本亦可)，新建VisuallC++ ->win32控制台应用程序，修改项目名称为Lua53，然后再点击确定。

点击下一步，选择静态库，空项目，点击完成。

将src目录下除了lua.c和luac.c其他所有文件加入lua53工程下的源文件目录

建立Luac编译器项目

打开VS2013(其他版本亦可)，新建VisuallC++ ->win32控制台应用程序，修改项目名称为Luac，然后再点击确定。

点击下一步，选择控制台应用程序，空项目，点击完成。

将src目录下除了lua.c其他所有文件加入lua53工程下的源文件目录

建立Lua解释器项目

打开VS2013(其他版本亦可)，新建VisuallC++ ->win32控制台应用程序，修改项目名称为Lua，然后再点击确定。

点击下一步，选择控制台应用程序，空项目，点击完成。

将src目录下除了luac.c其他所有文件加入lua53工程下的源文件目录

Lua的使用

最终我们会得到Lua53.lib, Luac.exe, Lua.exe。那要怎么使用呢？

Lua.exe 是一个交互式的命令行解释器，可以直接双击打开。

Luac.exe 是编译器。

新建一个Hello.lua，执行

Lua53.lib 是一个库文件，如果想要在C语言中嵌入Lua的话，就需要把这个文件加入到C语言的项目中。

参考链接

http://www.jianshu.com/p/2f649d9aef6d

Read All
[Lua-pil] 基础入门

2017-07-25

mdgsf

lua

Lua
读书笔记： Programming in Lua, 4th Edition.

HelloWorld

dofile 用来在交互式中加载lua文件。

lua 数据类型

There are eight basic types in Lua: nil, Boolean, number, string, userdata, function, thread, and table.
```
> type(nil) --> nil
> type(true) --> boolean
> type(10.4 * 3) --> number
> type("Hello world") --> string
> type(io.stdin) --> userdata
> type(print) --> function
> type(type) --> function
> type({}) --> table
> type(type(X)) --> string
```
Booleans

Conditional tests consider both the Boolean false and nil as false and anything else as true. In particular, Lua considers both zero and the empty string as true in conditional tests.

and, or, not 操作符

The result of the and operator is its first operand if that operand is false; otherwise, the result is its second operand.

The result of the or operator is its first operand if it is not false; otherwise, the result is its second operand
```
> 4 and 5 --> 5
> nil and 13 --> nil
> false and 13 --> false
> 0 or 5 --> 0
> false or "hi" --> "hi"
> nil or false --> false
```
The not operator always gives a Boolean value:
```
> not nil --> true
> not false --> true
> not 0 --> false
> not not 1 --> true
> not not nil --> false
```
A useful Lua idiom is x = x or v, which is equivalent to (if not x then x = v end).

Another useful idiom is ((a and b) or c) or simply (a and b or c) (given that and has a higher precedence than or). It is equivalent to the C expression a ? b : c.
Read All

[Linux] list

2017-07-21

Linux

Linux Kernel C List

list.h 源码

#ifndef _LINUX_LIST_H
#define _LINUX_LIST_H

#ifdef __KERNEL__

/*
 * Simple doubly linked list implementation.
 *
 * Some of the internal functions ("__xxx") are useful when
 * manipulating whole lists rather than single entries, as
 * sometimes we already know the next/prev entries and we can
 * generate better code by using them directly rather than
 * using the generic single-entry routines.
 */

struct list_head {
    struct list_head *next, *prev;
};

#define LIST_HEAD_INIT(name) { &(name), &(name) }

#define LIST_HEAD(name) \
    struct list_head name = LIST_HEAD_INIT(name)

#define INIT_LIST_HEAD(ptr) do { \
    (ptr)->next = (ptr); (ptr)->prev = (ptr); \
} while (0)

/*
 * Insert a new entry between two known consecutive entries.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
static __inline__ void __list_add(struct list_head * new,
    struct list_head * prev,
    struct list_head * next)
{
    next->prev = new;
    new->next = next;
    new->prev = prev;
    prev->next = new;
}

/**
 * list_add - add a new entry
 * @new: new entry to be added
 * @head: list head to add it after
 *
 * Insert a new entry after the specified head.
 * This is good for implementing stacks.
 */
static __inline__ void list_add(struct list_head *new, struct list_head *head)
{
    __list_add(new, head, head->next);
}

/**
 * list_add_tail - add a new entry
 * @new: new entry to be added
 * @head: list head to add it before
 *
 * Insert a new entry before the specified head.
 * This is useful for implementing queues.
 */
static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
{
    __list_add(new, head->prev, head);
}

/*
 * Delete a list entry by making the prev/next entries
 * point to each other.
 *
 * This is only for internal list manipulation where we know
 * the prev/next entries already!
 */
static __inline__ void __list_del(struct list_head * prev,
                  struct list_head * next)
{
    next->prev = prev;
    prev->next = next;
}

/**
 * list_del - deletes entry from list.
 * @entry: the element to delete from the list.
 * Note: list_empty on entry does not return true after this, the entry is in an undefined state.
 */
static __inline__ void list_del(struct list_head *entry)
{
    __list_del(entry->prev, entry->next);
}

/**
 * list_del_init - deletes entry from list and reinitialize it.
 * @entry: the element to delete from the list.
 */
static __inline__ void list_del_init(struct list_head *entry)
{
    __list_del(entry->prev, entry->next);
    INIT_LIST_HEAD(entry);
}

/**
 * list_empty - tests whether a list is empty
 * @head: the list to test.
 */
static __inline__ int list_empty(struct list_head *head)
{
    return head->next == head;
}

/**
 * list_splice - join two lists
 * @list: the new list to add.
 * @head: the place to add it in the first list.
 */
static __inline__ void list_splice(struct list_head *list, struct list_head *head)
{
    struct list_head *first = list->next;

    if (first != list) {
        struct list_head *last = list->prev;
        struct list_head *at = head->next;

        first->prev = head;
        head->next = first;

        last->next = at;
        at->prev = last;
    }
}

/**
 * list_entry - get the struct for this entry
 * @ptr: the &struct list_head pointer.
 * @type: the type of the struct this is embedded in.
 * @member: the name of the list_struct within the struct.
 */
#define list_entry(ptr, type, member) \
    ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))

/**
 * list_for_each - iterate over a list
 * @pos: the &struct list_head to use as a loop counter.
 * @head: the head for your list.
 */
#define list_for_each(pos, head) \
    for (pos = (head)->next; pos != (head); pos = pos->next)

#endif /* __KERNEL__ */

#endif

list_entry 解析

#include <stdio.h>

struct Node {
    int i;
    int j;
    int k;
};

#define list_entry(ptr, type, member) \
    ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))

int main()
{
    struct Node stNode;

    //使用场景：现在我有一个指向结构体内部成员的指针，这个时候我想要知道结构体的地址。
    int * ptr = &stNode.j;

    struct Node * pstNode = list_entry(ptr, struct Node, j);

    printf("&stNode = %p.\n", &stNode);
    printf("pstNode = %p.\n", pstNode);

    return 0;
}

Read All

[算法学习][leetcode] 3 Longest Substring without Repeating Characters

2017-07-20

mdgsf

Art

Leetcode

https://leetcode.com/problems/longest-substring-without-repeating-characters/description/

题目

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given “abcabcbb”, the answer is “abc”, which the length is 3.

Given “bbbbb”, the answer is “b”, with the length of 1.

Given “pwwkew”, the answer is “wke”, with the length of 3. Note that the answer must be a substring, “pwke” is a subsequence and not a substring.

题目翻译

题目解析

参考答案

#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
using namespace std;


class Solution {
public:
    int lengthOfLongestSubstring(string s) {

        int iLen = s.length();

        int iMaxSubLen = 0;
        int iSubLen = 0;
        int iSubStart = 0;
        int iSubEnd = 0;
        set<char> setCurSubCharacter;
        set<char>::iterator iter;

        for (int i = 0; i < iLen; i++)
        {
            char c = s[i];
            if(setCurSubCharacter.size() == 0)
            {
                setCurSubCharacter.insert(c);
                iSubStart = i;
                iSubEnd = i;
                iSubLen = 1;
                if(iSubLen > iMaxSubLen)
                {
                    iMaxSubLen = iSubLen;
                }
            }
            else
            {
                iter = setCurSubCharacter.find(c);
                if(iter != setCurSubCharacter.end())
                {
                    iSubEnd++;
                    while(1)
                    {
                        if(s[iSubStart] == c)
                        {
                            ++iSubStart;
                            break;
                        }
                        else
                        {
                            setCurSubCharacter.erase(s[iSubStart]);
                            ++iSubStart;
                        }
                    }
                    iSubLen = iSubEnd - iSubStart + 1;
                    if(iSubLen > iMaxSubLen)
                    {
                        iMaxSubLen = iSubLen;
                    }
                }
                else
                {
                    setCurSubCharacter.insert(c);
                    iSubEnd++;
                    iSubLen++;
                    if(iSubLen > iMaxSubLen)
                    {
                        iMaxSubLen = iSubLen;
                    }
                }
            }
        }

        return iMaxSubLen;
    }
};


int main()
{
    string s = "dvdf";
    Solution o;
    int iRet = o.lengthOfLongestSubstring(s);
    return 0;
}

Read All

57/97

Welcome to MDGSF's Blog!

[Lua-pil] 八皇后

[Lua-pil] 注释

[Lua-pil] 编译源码

介绍

编译源码

建立Lua53项目

建立Luac编译器项目

建立Lua解释器项目

Lua的使用

参考链接

[Lua-pil] 基础入门

HelloWorld

dofile 用来在交互式中加载lua文件。

lua 数据类型

Booleans

and, or, not 操作符

[Linux] list

list.h 源码

list_entry 解析

[算法学习][leetcode] 3 Longest Substring without Repeating Characters

题目

题目翻译

题目解析

参考答案