本文中所有代碼演示均有GitHub源碼，點(diǎn)擊下載 普通加密方法是講密碼進(jìn)行加密后保存到用戶偏好設(shè)置中 鑰匙串是以明文形式保存，但是不知道存放的具體位置 一. base64加密...
發(fā)簡(jiǎn)信
IP屬地：北京
-
iOS常見(jiàn)的幾種加密方法
-
動(dòng)態(tài)規(guī)劃（dynamic programming)（上）
本文根據(jù)Hawstein的BLOG，加入了自己的一些代碼實(shí)現(xiàn)和理解。概括：動(dòng)態(tài)規(guī)劃算法通?；谝粋€(gè)遞推公式及一個(gè)或多個(gè)初始狀態(tài)。 當(dāng)前子問(wèn)題的解將由上一次子問(wèn)題的解推出。使用...
-
Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.判定一個(gè)整數(shù)是不是回文的，...
-
String to Integer (atoi)
Implement atoi to convert a string to an integer.實(shí)現(xiàn)atoi，把一個(gè)字符串轉(zhuǎn)換為整數(shù)。Hint: Carefully con...
-
Reverse Integer
Reverse digits of an integer.反轉(zhuǎn)整數(shù)數(shù)字。Example1: x = 123, return 321Example2: x = -123, re...
-
ZigZag Conversion
The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows li...
-
Longest Palindromic SubstringGiven a string S, find the longest palindromic substring in S. You may assume that the ...
-
Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the medi...
-
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters.給...
-
Add Two Num
You are given two linked lists representing two non-negative numbers. The digits are st...
-
Two Sum
Given an array of integers, return **indices **of the two numbers such that they add up...
-
Two Sum
Given an array of integers, return **indices **of the two numbers such that they add up...
-
關(guān)于iOS多線程，你看我就夠了
在這篇文章中，我將為你整理一下 iOS 開(kāi)發(fā)中幾種多線程方案，以及其使用方法和注意事項(xiàng)。當(dāng)然也會(huì)給出幾種多線程的案例，在實(shí)際使用中感受它們的區(qū)別。還有一點(diǎn)需要說(shuō)明的是，這篇文...