上一页 1 ··· 109 110 111 112 113 114 115 116 117 ··· 119 下一页
摘要: ->是指针指向其成员的运算符.是结构体的成员运算符如:struct A{ int a; int b;};A *point = malloc(sizeof(struct A));point->a = 1;A object;object.a = 1;#include#define N 8 ... 阅读全文
posted @ 2015-08-22 23:11 鸭子船长 阅读(862) 评论(0) 推荐(0) 编辑
摘要: 转自:http://blog.csdn.net/no_retreats/article/details/8146585定义一个二维数组:int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, ... 阅读全文
posted @ 2015-08-22 22:55 鸭子船长 阅读(461) 评论(0) 推荐(0) 编辑
摘要: 本文来自:http://www.matrix67.com/blog/archives/tag/poj大牛的博文学习学习节选如下部分:矩阵乘法的两个重要性质:一,矩阵乘法不满足交换律;二,矩阵乘法满足结合律经典题目1 给定n个点,m个操作,构造O(m+n)的算法输出m个操作后各点的位置。操作有平移、缩... 阅读全文
posted @ 2015-08-21 21:50 鸭子船长 阅读(687) 评论(0) 推荐(0) 编辑
摘要: 转自http://blog.csdn.net/yunyun1886358/article/details/5659851数组名作为形参 1 void func1(int iArray[][10]) 2 { 3 4 } 5 6 7 8 int main() 9 {10 int arra... 阅读全文
posted @ 2015-08-21 18:40 鸭子船长 阅读(7273) 评论(0) 推荐(1) 编辑
摘要: Implement regular expression matching with support for'.'and'*'.'.' Matches any single character.'*' Matches zero or more of the preceding element.The... 阅读全文
posted @ 2015-08-15 23:44 鸭子船长 阅读(246) 评论(0) 推荐(0) 编辑
摘要: Determine whether an integer is a palindrome. Do this without extra space. click to show spoilers. Some hints: Could negative integers be palindromes? 阅读全文
posted @ 2015-08-14 17:04 鸭子船长 阅读(155) 评论(0) 推荐(0) 编辑
摘要: mplement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below a 阅读全文
posted @ 2015-08-10 00:12 鸭子船长 阅读(200) 评论(0) 推荐(0) 编辑
摘要: Reverse digits of an integer. Example1: x = 123, return 321Example2: x = -123, return -321 click to show spoilers. Have you thought about this? Here a 阅读全文
posted @ 2015-08-09 23:25 鸭子船长 阅读(146) 评论(0) 推荐(0) 编辑
摘要: The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font 阅读全文
posted @ 2015-08-09 15:57 鸭子船长 阅读(153) 评论(0) 推荐(0) 编辑
摘要: Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longes 阅读全文
posted @ 2015-08-09 00:16 鸭子船长 阅读(194) 评论(0) 推荐(0) 编辑
上一页 1 ··· 109 110 111 112 113 114 115 116 117 ··· 119 下一页