zwfang

/************************************************************/
/**               马踏棋盘算法(骑士周游问题)                  **/
/************************************************************/

#include <stdio.h>
#include <time.h>

#define X 8
#define Y 8

zwfang

#!/usr/bin/env python3
import copy


class Solution:
    def __init__(self):
        self.res = []
    
    def combine(self, n, k):
        """

zwfang

#!/usr/bin/env python3
"""
Given a 2D board and a word, find if the word exists in the grid.

The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.

Example:

board =
[

zwfang

#!/usr/bin/env python3
import sys


def move(n, x, y, z):
    if n == 1:
        print("%s --> %s" % (x, z))
    else:
        move(n-1, x, z, y)
        print("%s --> %s" % (x, z))

zwfang

package main

import "fmt"

func fib() func() int64 {
	var i int64
	var j int64 = 1
	return func() int64 {
		i, j = j, i+j
		return i

zwfang

//
//  main.c
//  reverse node in k group
//
//  Created by fzw on 10/12/18.
//  Copyright © 2018 n. All rights reserved.
//

#include <stdio.h>
#include <stdlib.h>

zwfang

//
//  main.c
//  RotateList
//
//  Created by fzw on 10/7/18.
//  Copyright © 2018 n. All rights reserved.
//

#include <stdio.h>

zwfang

//
//  main.c
//  addBinary
//
//  Created by fzw on 10/7/18.
//  Copyright © 2018 n. All rights reserved.
//

#include <stdio.h>
#include <string.h>

zwfang

//
//  main.c
//  MergeTwoSortedArray
//
//  Created by fzw on 9/26/18.
//  Copyright © 2018 n. All rights reserved.
//

#include <stdio.h>
#include <stdlib.h>

zwfang

//
//  main.c
//  narcissisticNumber
//
//  Created by fzw on 10/7/18.
//  Copyright © 2018 n. All rights reserved.
//

#include <stdio.h>