jhyworkspace的博客

/**********************************************//******find whether two strings same thing ****//**********************************************/#include char *find_char(char *source,char *chars)

1、下载nasm安装包#wget http://www.nasm.us/pub/nasm/releasebuilds/2.11.08/nasm-2.11.08.tar.gz2、解压安装nasm#tar -xzvf nasm-2.11.08.tar.gz#cd nasm-2.11.08#./configure#make#make install3、编写hello.as

用递归做得，遇到的坑是用cygwin带的gcc编译，总是遇到各种莫名其妙的段溢出。。。珍爱生命，远离cygwin。。#include "stdio.h"#include "stdlib.h"#include "string.h" //Definition for a binary tree node. struct TreeNode { char val;

代码很简单，采用查表法做。所以直接贴出来吧。#include #include #include "string.h"char lut_1[10][8] = {"I","II","III","IV","V","VI","VII","VIII","IX"};char lut_10[10][8] = {"X","XX","XXX","XL","L","LX","LXX","LXXX","XC

这个仍旧使用查表法，比较简单，直接上代码：#include #include #include "string.h"#include "math.h"char lut_1[10][8] = {"I","II","III","IV","V","VI","VII","VIII","IX"};char lut_10[10][8] = {"X","XX","XXX","XL","L","L

这个题目十分简单，直接循环就可求出来。#include #include int calc_rect(int cof1 , int cof2){ if(cof1 <= cof2 ) return 2*cof1; else return 2*cof2;}int process(int *buf , int lens){ int k=0,f=k+1 , max_rec

这里仍旧使用暴力求解法，求出矩阵中的最大的矩形面积。/*calc max rect in a matrixeg:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0res: 6*/int buf_all[4][5] = {1 ,1 ,1 ,1 ,1 , 1 ,1 ,1 ,1 ,1 , 1 ,1 ,1 ,1 ,1 ,

这次欠债比较多，所以，这次的代码风格很差。方法是最暴力的暴力求解法。//ip restore//if input is 19216811//out put should be 192.168.1.1 or 19.216.8.11 or some_str available else#include #include #include #define LOG_FLAG 1/*