iOS经典面试会问到的一些问题:自己经过半个多月为大家整理出来的,有的答案不是唯一的!
1、 简述OC中内存管理机制。与retain配对使用的方法是dealloc还是release,为什么?需要与alloc配对使用的方法是dealloc还是release,为什么?readwrite,readonly,assign,retain,copy,nonatomic 、atomic、strong、...
分类：
移动开发 时间：
2015-03-05 17:12:57
阅读次数：
282
1. const经典面试题 1> const int age1 = 21; age1 = 100; // 编译报错 2> int const age2 = 22; 3> constint *age3 = 23; int val1 = 101; *age3 = val1; ...
分类：
移动开发 时间：
2015-03-05 16:48:30
阅读次数：
159
题目Given a string s, partition s such that every substring of the partition is a palindrome.Return the minimum cuts needed for a palindrome partitioning of s.For example, given s = “aab”,
Return 1 sinc...
分类：
其他好文 时间：
2015-03-02 23:58:14
阅读次数：
368
题目Given a string s, partition s such that every substring of the partition is a palindrome.Return all possible palindrome partitioning of s.For example, given s = “aab”,
Return[
[“aa”,”b”],...
分类：
其他好文 时间：
2015-03-02 22:35:33
阅读次数：
149
题目Given a collection of integers that might contain duplicates, S, return all possible subsets.Note:
Elements in a subset must be in non-descending order.
The solution set must not contain duplicate...
分类：
其他好文 时间：
2015-03-01 22:22:10
阅读次数：
226
C#经典面试题：有3个线程，A线程打印1，B线程打印2，C线程打印3，请用程序实现依次打印123123123... 1 class Program 2 { 3 static void Main(string[] args) 4 { 5 ...
分类：
编程语言 时间：
2015-03-01 22:20:27
阅读次数：
136
题目Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)You have the following 3 operations permitted on a word:a)...
分类：
其他好文 时间：
2015-03-01 13:18:01
阅读次数：
124
题目Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Determine if you a...
分类：
其他好文 时间：
2015-02-28 23:05:45
阅读次数：
276
题目Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:
Try to come up as many solutions as you can, th...
分类：
其他好文 时间：
2015-02-25 23:46:18
阅读次数：
157
题目Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,
S = “ADOBECODEBANC”
T = “ABC”
Minimum window is “BANC”.Note...
