校验和算法

  • n5_504512
    了解作者
  • 504.5KB
    文件大小
  • zip
    文件格式
  • 0
    收藏次数
  • VIP专享
    资源类型
  • 0
    下载次数
  • 2022-04-07 08:46
    上传日期
#include <stdio.h> #include <iostream.h> #include <stdlib.h> #include <string.h> #define MAX_BUFF 256 void main(int argc,char* argv[]) { FILE* stream; char buff[MAX_BUFF]; //缓冲区数组 最大256个字符 long sum=0; //累加器 char nstring[5]; //待转换成数字进行累加的字符串 (4个) int number=0; //待加数 unsigned short checksum; //校验和 int count; // for(int count=0;count<MAX_BUFF;count++) // buff[count]='\0'; if(argc!=2) { printf("args error!"); return; } //如果参数个数不对,则打印错误,返回 if((stream=fopen&#40;argv[1],"r"&#41;)!=NULL) //打开对应文件,准备操作 { while(!feof(stream)) //如果文件结束则累加操作结束 { for(count=0;!feof(stream)&&(count<MAX_BUFF);count++) //从文件中读出数据到缓冲区,最大不能超过 { //缓冲区容量,且忽略空格,count最后存放读出 char a=fgetc(stream); //数据的个数 while(a==' ') a=fgetc(stream); buff[count]=a; } if(feof(stream)) count--; //如果文件已经结束,则计数器count减一 for(int j=0;j<count;j+=4) //从缓冲区中读出数据,并转换成数值 { //每次读4个 for(int k=0;k<4;k++) nstring[k]=buff[j+k]; nstring[4]='\0'; sscanf(nstring,"%x",&number;); sum+=number; //将转换好的数据累加 } if(j>count) //如果数据为奇数个,则补一个00 { nstring[0]=buff[count-2]; nstring[1]=buff[count-1]; nstring[2]='0'; nstring[3]='0'; nstring[4]='\0'; sscanf(nstring,"%x",&number;); sum+=number; } } while(sum>>16) //高位累加 sum = (sum & 0xffff) + (sum >> 16); checksum=~(unsigned short)sum; //累加和取反得校验和 printf("%x\n",checksum); } fclose(stream); }
校验和算法.zip
  • 校验和算法
  • Debug
  • vc60.pdb
    60KB
  • check_sum.pch
    271.6KB
  • vc60.idb
    49KB
  • check_sum.exe
    184.1KB
  • check_sum.obj
    4.1KB
  • framer.exe
    180.1KB
  • framer.pch
    219.1KB
  • check_sum.pdb
    377KB
  • framer.pdb
    369KB
  • check_sum.ilk
    187.4KB
  • framer.obj
    5KB
  • framer.ilk
    183.7KB
  • check_sum.ncb
    41KB
  • check_sum.dsw
    541B
  • input1
    20B
  • check_sum.cpp
    1.7KB
  • check_sum.dsp
    3.4KB
  • output1
    69B
  • check_sum.exe
    168KB
  • framer.exe
    160KB
  • framer.dsp
    3.3KB
  • framer.doc
    30.5KB
  • check_sum.plg
    1.1KB
  • framer.plg
    1.1KB
  • framer.opt
    52.5KB
  • framer.cpp
    2.1KB
  • infile2.txt
    404B
  • framer.dsw
    535B
  • check_sum.doc
    20.5KB
  • input2
    556B
  • check_sum.opt
    52.5KB
  • output2
    579B
  • infile1.txt
    59B
  • framer.ncb
    33KB
内容介绍
<html xmlns="http://www.w3.org/1999/xhtml"> <head> <meta charset="utf-8"> <meta name="generator" content="pdf2htmlEX"> <meta http-equiv="X-UA-Compatible" content="IE=edge,chrome=1"> <link rel="stylesheet" href="https://static.pudn.com/base/css/base.min.css"> <link rel="stylesheet" href="https://static.pudn.com/base/css/fancy.min.css"> <link rel="stylesheet" href="https://static.pudn.com/prod/directory_preview_static/6267621b4f8811599ee65181/raw.css"> <script src="https://static.pudn.com/base/js/compatibility.min.js"></script> <script src="https://static.pudn.com/base/js/pdf2htmlEX.min.js"></script> <script> try{ pdf2htmlEX.defaultViewer = new pdf2htmlEX.Viewer({}); }catch(e){} </script> <title></title> </head> <body> <div id="sidebar" style="display: none"> <div id="outline"> </div> </div> <div id="pf1" class="pf w0 h0" data-page-no="1"><div class="pc pc1 w0 h0"><img class="bi x0 y0 w1 h1" alt="" src="https://static.pudn.com/prod/directory_preview_static/6267621b4f8811599ee65181/bg1.jpg"><div class="c x0 y1 w2 h2"><div class="t m0 x1 h3 y2 ff1 fs0 fc0 sc0 ls0 ws0">&#24103;&#23553;&#35013;</div><div class="t m0 x2 h4 y3 ff1 fs1 fc0 sc1 ls0 ws0">&#26412;<span class="_ _0"></span>&#31243;<span class="_ _0"></span>&#24207;<span class="_ _0"></span>&#35201;<span class="_ _0"></span>&#27714;<span class="_ _0"></span>&#26681;<span class="_ _0"></span>&#25454;<span class="_ _0"></span>&#25968;<span class="_ _0"></span>&#25454;<span class="_ _0"></span>&#38142;<span class="_ _0"></span>&#36335;<span class="_ _0"></span>&#23618;<span class="_ _0"></span>&#21407;<span class="_ _0"></span>&#29702;<span class="_ _0"></span>&#65292;<span class="_ _0"></span>&#23545;<span class="_ _0"></span>&#25968;<span class="_ _0"></span>&#25454;<span class="_ _0"></span>&#36827;<span class="_ _0"></span>&#34892;<span class="_ _0"></span>&#27169;<span class="_ _0"></span>&#25311;<span class="_ _0"></span>&#23553;<span class="_ _0"></span>&#35013;<span class="_ _0"></span>&#65292;<span class="_ _0"></span>&#25152;<span class="_ _0"></span>&#20197;<span class="_ _0"></span>&#22312;<span class="_ _0"></span>&#23553;<span class="_ _0"></span>&#35013;<span class="_ _0"></span>&#26102;<span class="_ _0"></span>&#65292;</div><div class="t m0 x3 h4 y4 ff1 fs1 fc0 sc1 ls0 ws0">&#25105;&#20204;<span class="_ _0"></span>&#35774;&#35745;<span class="_ _0"></span>&#20102;&#19968;<span class="_ _0"></span>&#20010;&#25253;&#22836;<span class="_ _0"></span>&#32467;&#26500;<span class="_ _1"> </span><span class="ff2">head</span>&#65292;<span class="_ _0"></span>&#26469;&#22635;&#20805;<span class="_ _0"></span>&#25968;&#25454;<span class="_ _0"></span>&#38142;&#36335;<span class="_ _0"></span>&#23618;&#25253;<span class="_ _0"></span>&#22836;&#20449;<span class="_ _0"></span>&#24687;&#21644;<span class="_ _0"></span>&#29289;&#29702;<span class="_ _0"></span>&#23618;&#30340;<span class="_ _0"></span>&#21069;&#23548;<span class="_ _0"></span>&#30721;</div><div class="t m0 x3 h4 y5 ff1 fs1 fc0 sc1 ls0 ws0">&#21644;&#24103;&#23450;&#30028;&#31526;&#20449;&#24687;&#12290;</div><div class="t m0 x2 h4 y6 ff1 fs1 fc0 sc1 ls0 ws0">&#31243;&#24207;&#27969;&#31243;&#22914;&#19979;&#65306;</div><div class="t m0 x2 h4 y7 ff2 fs1 fc0 sc1 ls0 ws0">1<span class="ff1">&#65294;<span class="_ _2"> </span>&#25171;&#24320;&#36755;&#20837;&#25991;&#20214;&#21644;&#36755;&#20986;&#25991;&#20214;&#65292;</span></div><div class="t m0 x2 h4 y8 ff2 fs1 fc0 sc1 ls0 ws0">2<span class="ff1">&#65294;<span class="_ _2"> </span>&#23545;&#25253;&#22836;&#25968;&#25454;&#36827;&#34892;&#22635;&#20805;&#65292;&#24182;&#32479;&#35745;&#36755;&#20837;&#25968;&#25454;&#38271;&#24230;&#65292;&#22635;&#20805;&#25253;&#22836;&#30340;<span class="_ _3"> </span></span>length<span class="_ _3"> </span><span class="ff1">&#23383;&#27573;&#65292;</span></div><div class="t m0 x2 h4 y9 ff2 fs1 fc0 sc1 ls0 ws0">3<span class="ff1">&#65294;<span class="_ _2"> </span>&#23558;&#25253;&#22836;&#32467;&#26500;&#20889;&#20837;&#36755;&#20986;&#25991;&#20214;</span></div><div class="t m0 x2 h4 ya ff2 fs1 fc0 sc1 ls0 ws0">4<span class="ff1">&#65294;<span class="_ _2"> </span>&#23545;&#25968;&#25454;&#38142;&#36335;&#23618;&#25253;&#22836;&#20449;&#24687;&#36827;&#34892;<span class="_ _3"> </span></span>CRC8<span class="_ _3"> </span><span class="ff1">&#26657;&#39564;&#65292;</span></div><div class="t m0 x2 h4 yb ff2 fs1 fc0 sc1 ls0 ws0">5<span class="ff1">&#65294;<span class="_ _2"> </span>&#23545;&#36755;&#20837;&#25968;&#25454;&#36827;&#34892;<span class="_ _3"> </span></span>CRC8<span class="_ _3"> </span><span class="ff1">&#26657;&#39564;&#65292;&#24182;&#23558;&#36755;&#20837;&#25968;&#25454;&#20889;&#20837;&#36755;&#20986;&#25991;&#20214;&#65292;</span></div><div class="t m0 x2 h4 yc ff2 fs1 fc0 sc1 ls0 ws0">6<span class="ff1">&#65294;<span class="_ _2"> </span>&#23558;&#26368;&#21518;&#25152;&#24471;<span class="_ _3"> </span></span>CRC<span class="_ _3"> </span><span class="ff1">&#26657;&#39564;&#30721;&#20889;&#20837;&#36755;&#20986;&#25991;&#20214;&#23614;&#65292;&#24182;&#20851;&#38381;&#36755;&#20837;&#36755;&#20986;&#25991;&#20214;&#12290;</span></div><div class="t m0 x3 h4 yd ff1 fs1 fc0 sc1 ls0 ws0">&#31243;&#24207;&#30340;&#26680;&#24515;&#22312;&#20110;<span class="ff2">CRC8</span>&#26657;&#39564;&#12290;<span class="ff2">CRC</span>&#26657;&#39564;&#31639;&#27861;&#19968;&#33324;&#26377;&#20004;&#31181;&#65292;&#20854;&#20013;&#19968;&#31181;&#26159;&#37319;&#29992;&#26597;&#34920;&#27861;&#65292;</div><div class="t m0 x3 h4 ye ff1 fs1 fc0 sc1 ls0 ws0">&#20063;&#23601;&#26159;&#20551;&#35774;&#36890;&#36807;&#31227;&#20301;&#22788;&#29702;&#20102;<span class="ff2">8 </span>&#20010;<span class="ff2">bit </span>&#30340;&#25968;&#25454;&#65292;&#30456;&#24403;&#20110;&#25226;&#20043;&#21069;&#30340;<span class="ff2">CRC </span>&#30721;&#30340;&#39640;&#23383;&#33410;</div><div class="t m0 x3 h4 yf ff2 fs1 fc0 sc1 ls0 ws0">(8bit)<span class="ff1">&#20840;&#37096;&#31227;&#20986;&#65292;&#19982;&#19968;&#20010;</span>byte <span class="ff1">&#30340;&#25968;&#25454;&#20570;</span>XOR <span class="ff1">&#36816;&#31639;&#65292;&#26681;&#25454;&#36816;&#31639;&#32467;&#26524;&#26469;&#36873;&#25321;&#19968;&#20010;&#20540;</span></div><div class="t m0 x3 h4 y10 ff2 fs1 fc0 sc1 ls0 ws0">(<span class="ff1">&#31216;&#20026;&#20313;&#24335;</span>)<span class="ff1">&#65292;&#19982;&#21407;&#26469;&#30340;</span>CRC <span class="ff1">&#30721;&#20877;&#20570;&#19968;&#27425;</span>XOR <span class="ff1">&#36816;&#31639;&#65292;&#23601;&#21487;&#20197;&#24471;&#21040;&#26032;&#30340;</span>CRC <span class="ff1">&#30721;<span class="fs2">&#12290;&#25105;</span></span></div><div class="t m0 x3 h4 y11 ff1 fs2 fc0 sc1 ls0 ws0">&#37319;&#29992;&#30340;&#26159;&#21478;&#22806;&#19968;&#31181;&#31639;&#27861;&#65292;<span class="ff2 fs1">CRC8<span class="ff1">&#26657;&#39564;&#20989;&#25968;&#22914;&#19979;&#65306;</span></span></div><div class="t m0 x4 h5 y12 ff2 fs1 fc0 sc1 ls0 ws0">for(int i=0x80;i!=0;i&gt;&gt;=1)</div><div class="t m0 x4 h5 y13 ff2 fs1 fc0 sc1 ls0 ws0">{</div><div class="t m0 x5 h5 y14 ff2 fs1 fc0 sc1 ls0 ws0">if((crc&amp;0x80)!=0) {crc&lt;&lt;=1;crc^=0x07;}<span class="_ _4"> </span>L-1</div><div class="t m0 x5 h5 y15 ff2 fs1 fc0 sc1 ls0 ws0">else crc&lt;&lt;=1;<span class="_ _5"> </span>L-2</div><div class="t m0 x5 h5 y16 ff2 fs1 fc0 sc1 ls0 ws0">if(data&amp;i) crc^=0x07;<span class="_ _6"> </span>L-3</div><div class="t m0 x4 h5 y17 ff2 fs1 fc0 sc1 ls0 ws0">}</div><div class="t m0 x2 h4 y18 ff1 fs1 fc0 sc1 ls0 ws0">&#20854;&#20013;<span class="_ _3"> </span><span class="ff2">crc<span class="_"> </span></span>&#21363;&#20026;<span class="_ _3"> </span><span class="ff2">crc<span class="_ _3"> </span></span>&#26657;&#39564;&#30721;<span class="_ _0"></span>&#65292;<span class="ff2">data<span class="_ _7"> </span></span>&#20026;&#24453;&#26657;<span class="_ _0"></span>&#39564;&#25968;&#25454;&#65292;<span class="_ _0"></span>&#38271;&#24230;&#20026;<span class="_ _0"></span>&#19968;&#20010;&#23383;&#33410;<span class="_ _0"></span>&#12290;<span class="_ _0"></span><span class="ff2">i<span class="_ _3"> </span></span>&#20026;<span class="_ _0"></span>&#35745;&#25968;&#22120;<span class="_ _0"></span>&#65292;</div><div class="t m0 x2 h4 y19 ff1 fs1 fc0 sc1 ls0 ws0">&#20182;<span class="_ _0"></span>&#23558;<span class="_ _0"></span>&#25968;<span class="_ _8"></span>&#25454;<span class="_ _0"></span>&#25353;<span class="_ _0"></span>&#20174;<span class="_ _8"></span>&#39640;<span class="_ _0"></span>&#21040;<span class="_ _0"></span>&#24213;<span class="_ _8"></span>&#30340;<span class="_ _0"></span>&#39034;<span class="_ _0"></span>&#24207;<span class="_ _8"></span>&#20381;<span class="_ _0"></span>&#27425;<span class="_ _0"></span>&#36827;<span class="_ _8"></span>&#20837;<span class="_ _2"> </span><span class="ff2">crc<span class="_"> </span></span>&#26657;<span class="_ _0"></span>&#39564;<span class="_ _0"></span>&#12290;<span class="_ _0"></span><span class="ff2">L-1<span class="_"> </span></span>&#21028;<span class="_ _0"></span>&#26029;<span class="_ _7"> </span><span class="ff2">crc<span class="_"> </span></span>&#26657;<span class="_ _0"></span>&#39564;<span class="_ _8"></span>&#30721;<span class="_ _0"></span>&#39640;<span class="_ _0"></span>&#20301;<span class="_ _8"></span>&#26159;</div><div class="t m0 x2 h4 y1a ff1 fs1 fc0 sc1 ls0 ws0">&#21542;<span class="_ _0"></span>&#20026;<span class="_ _7"> </span><span class="ff2">1<span class="_ _0"></span></span>&#65292;<span class="_ _0"></span>&#22914;<span class="_ _8"></span>&#26524;<span class="_ _0"></span>&#26159;<span class="_ _7"> </span><span class="ff2">1<span class="_ _8"></span></span>&#65292;<span class="_ _0"></span>&#23601;<span class="_ _0"></span>&#23558;<span class="_ _7"> </span><span class="ff2">crc<span class="_"> </span></span>&#23492;<span class="_ _0"></span>&#23384;<span class="_ _0"></span>&#22120;<span class="_ _0"></span>&#20013;<span class="_ _0"></span>&#38500;<span class="_ _0"></span>&#26368;<span class="_ _0"></span>&#21518;<span class="_ _8"></span>&#19968;<span class="_ _0"></span>&#20301;<span class="_ _0"></span>&#20197;<span class="_ _0"></span>&#22806;<span class="_ _0"></span>&#20854;<span class="_ _0"></span>&#20182;<span class="_ _8"></span>&#20301;<span class="_ _0"></span>&#21644;<span class="_ _2"> </span><span class="ff2">1<span class="_"> </span></span>&#24322;<span class="_ _0"></span>&#25110;<span class="_ _0"></span>&#65292;<span class="_ _0"></span>&#24182;</div><div class="t m0 x2 h4 y1b ff1 fs1 fc0 sc1 ls0 ws0">&#31227;&#20301;<span class="_ _0"></span>&#65292;<span class="_ _0"></span>&#22914;&#26524;<span class="_ _0"></span>&#26159;<span class="_ _2"> </span><span class="ff2">0</span>&#65292;<span class="_ _0"></span>&#23601;<span class="_ _0"></span>&#23558;<span class="_ _7"> </span><span class="ff2">crc<span class="_ _3"> </span></span>&#23492;<span class="_ _0"></span>&#23384;<span class="_ _0"></span>&#22120;&#20013;<span class="_ _0"></span>&#38500;<span class="_ _0"></span>&#26368;&#21518;<span class="_ _0"></span>&#19968;<span class="_ _0"></span>&#20301;&#20197;<span class="_ _0"></span>&#22806;<span class="_ _0"></span>&#20854;&#20182;<span class="_ _0"></span>&#20026;<span class="_ _0"></span>&#21644;<span class="_ _1"> </span><span class="ff2">0<span class="_ _3"> </span></span>&#24322;<span class="_ _0"></span>&#25110;<span class="_ _0"></span>&#65292;&#24182;<span class="_ _0"></span>&#31227;</div><div class="t m0 x2 h4 y1c ff1 fs1 fc0 sc1 ls0 ws0">&#20301;&#12290;&#30001;&#20110;&#20219;&#20309;&#25968;&#21644;<span class="_ _3"> </span><span class="ff2">0<span class="_ _3"> </span></span>&#24322;&#25110;&#20197;&#21518;&#20854;&#20540;&#19981;&#21464;&#65292;&#25152;&#20197;&#21482;&#29992;&#36827;&#34892;&#31616;&#21333;&#31227;&#20301;&#21363;&#21487;&#12290;</div><div class="t m0 x4 h4 y1d ff1 fs1 fc0 sc1 ls0 ws0">&#26681;&#25454;&#39064;&#30446;&#25152;<span class="_ _0"></span>&#35859;&#23492;&#23384;&#22120;&#36827;&#20301;&#31639;&#27861;<span class="_ _0"></span>&#65292;&#24403;&#23545;&#25152;&#26377;&#25968;<span class="_ _0"></span>&#25454;&#36827;&#34892;<span class="_ _1"> </span><span class="ff2">CRC8<span class="_ _3"> </span></span>&#26657;&#39564;<span class="_ _0"></span>&#20197;&#21518;&#65292;&#36824;</div><div class="t m0 x2 h4 y1e ff1 fs1 fc0 sc1 ls0 ws0">&#35201;<span class="_ _0"></span>&#23545;<span class="_ _3"> </span><span class="ff2">0x00<span class="_"> </span></span>&#20877;&#36827;<span class="_ _0"></span>&#34892;<span class="_ _0"></span>&#19968;<span class="_ _0"></span>&#27425;&#26657;<span class="_ _0"></span>&#39564;<span class="_ _0"></span>&#12290;<span class="_ _0"></span>&#32780;<span class="_ _0"></span>&#36825;<span class="_ _0"></span>&#37324;&#30340;<span class="_ _0"></span>&#31639;<span class="_ _0"></span>&#27861;<span class="_ _0"></span>&#30001;<span class="_ _0"></span>&#20110;<span class="_ _0"></span>&#22312;<span class="_ _7"> </span><span class="ff2">L-3<span class="_"> </span></span>&#20013;&#21028;<span class="_ _0"></span>&#26029;&#25968;<span class="_ _0"></span>&#25454;<span class="_ _0"></span>&#26102;<span class="_ _0"></span>&#65292;<span class="_ _0"></span>&#22914;<span class="_ _0"></span>&#26524;</div><div class="t m0 x2 h4 y1f ff1 fs1 fc0 sc1 ls0 ws0">&#25968;&#25454;&#20301;&#20026;<span class="_ _7"> </span><span class="ff2">1</span>&#65292;&#21017;&#23558;<span class="_ _0"></span>&#21518;&#38754;<span class="_ _7"> </span><span class="ff2">3<span class="_ _3"> </span></span>&#20010;&#23492;&#23384;&#22120;&#20869;<span class="_ _0"></span>&#30340;&#20540;&#37117;&#36827;&#34892;&#24322;&#25110;&#22788;<span class="_ _0"></span>&#29702;&#65292;&#25152;&#20197;&#26368;&#21518;<span class="_ _0"></span>&#19981;&#29992;&#22686;</div><div class="t m0 x2 h4 y20 ff1 fs1 fc0 sc1 ls0 ws0">&#21152;&#23545;<span class="_ _3"> </span><span class="ff2">0x00<span class="_ _3"> </span></span>&#30340;<span class="_ _3"> </span><span class="ff2">CRC<span class="_ _3"> </span></span>&#26657;&#39564;&#22788;&#29702;&#12290;&#20854;&#31561;&#20215;&#30340;&#23492;&#23384;&#22120;&#29366;&#24577;&#22270;&#22914;&#19979;&#65306;</div><div class="t m0 x4 h4 y21 ff1 fs1 fc0 sc1 ls0 ws0">&#32463;&#39564;&#35777;&#65292;&#36825;&#31181;&#31639;&#27861;&#30340;&#32467;&#26524;&#21644;&#39064;&#30446;&#25152;&#35859;&#31639;&#27861;&#32467;&#26500;&#30456;&#21516;&#12290;</div><div class="t m0 x6 h6 y22 ff2 fs2 fc0 sc1 ls0 ws0">xor<span class="_ _9"> </span>xor</div><div class="t m0 x7 h6 y23 ff2 fs2 fc0 sc1 ls0 ws0">input</div><div class="t m0 x8 h6 y22 ff2 fs2 fc0 sc1 ls0 ws0">xor</div></div></div><div class="pi" data-data='{"ctm":[1.611850,0.000000,0.000000,1.611850,0.000000,0.000000]}'></div></div> </body> </html>
评论
    相关推荐
    • a*寻路算法ios实现过程
      a*寻路算法ios实现过程,用简练的代码最容易的说明问题全部; 描述:带2叉堆的A*寻路算法,地图为30*20的方格,可点击更换地图,可指定起始点和目的地。 因为是用以前自己参加acm时的代码,所以数据计算部分使用的...
    • BAT iOS 算法笔试题集合
      BAT等大厂iOS算法面试题集合,有志于去大厂的同学可以下载
    • IOS 九宫格算法
      有时候布局的时候需要像九宫格那样布局,我自己也遇到过好多次,每次处理起来感觉好麻烦,后面自己研究了一下,发现了一个很简单的算法,几句代码就可以轻松搞定。
    • BAT iOS 算法面试题集合
      BAT等大厂iOS算法面试题集合,包括解析、思路和答案,有志于去大厂的同学可以下载
    • iOS桶排序算法
      桶排序算法是常见排序里最快的一种,比快排还要快…可扩展。iOS版的桶排序算法,欢迎大家学习,交流~
    • swift-iOS图片精确提取主色调算法iOS-Palette.zip
      iOS图片精确提取主色调算法iOS-Palette
    • IOS开发算法
      本Demo是通过Objective-c写的冒泡排序,插入排序,选择排序
    • ios版的SM2公钥加密算法
      ios版的SM2公钥加密算法
    • iOS 面试必看算法
      iOS 面试的要求正在逐步提高,对于算法的要求也在逐步提升,这个文件带领你学习iOS 算法。让你直通BATJ
    • 实现各种图像处理的算法ios
      该源码由源码天堂IOS源码频道免费提供下载。源码实现各种图像处理的算法,包括:高斯模糊(Gaussian Blur),边缘提取(Edge Detection),锐化(Sharpen),直方图均(Equalization)等等。喜欢的朋友可以下载学习...