码迷,mamicode.com
首页 >  
搜索关键字:where    ( 20257个结果
PHP 设计模式 笔记与总结(4)PHP 链式操作的实现
PHP 链式操作的实现$db->where()->limit()->order();在 Common 下创建 Database.php。链式操作最核心的地方在于:在方法的最后 return $this;Database.php:where('id = 1');//$db->where('name =...
分类:Web程序   时间:2015-04-09 23:30:39    阅读次数:167
Hiberate--one to many
这是一个过滤条件 select * from forumreply where post_id=@forumpost.postId 3. ...
分类:其他好文   时间:2015-04-09 21:44:18    阅读次数:118
Eclipse配置问题:Error :- java runtime environment JRE or java development kit must be available in order to run eclipse
Let eclipse use your java vm directly!Put these lines at the end of eclipse.ini (located in the directory where eclipse.exe is present):-vm/bin/javaw....
分类:编程语言   时间:2015-04-09 21:34:27    阅读次数:138
oracle复制表的sql语句
如下,表a是数据库中已经存在的表,b是准备根据表a进行复制创建的表: 1、只复制表结构的sql create table b as select * from a where 11 2、即复制表结构又复制表中数据的sql create table b as select * from a ...
分类:数据库   时间:2015-04-09 21:33:09    阅读次数:201
【LeetCode】Path Sum II
题意Given a binary tree and a sum, find all root-to-leaf paths where each path’s sum equals the given sum.思路基本的深搜,注意一点就是必须是根到叶子节点求和,不可在非叶子节点处停。代码/** * Definition for binary tree * struct TreeNode { *...
分类:其他好文   时间:2015-04-09 17:25:31    阅读次数:147
[LeetCode] Convert Sorted Array to Binary Search Tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST.Hide TagsTreeDepth-first Search方法一:递归,也是dfs/** * Defi...
分类:其他好文   时间:2015-04-09 17:08:07    阅读次数:105
[Leetcode] Convert Sorted List to Binary Search Tree
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.Hide TagsDepth-first SearchLinked List方法一...
分类:其他好文   时间:2015-04-09 16:50:31    阅读次数:144
Trapping Rain Water
Givennnon-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.Fo...
分类:移动开发   时间:2015-04-09 15:09:04    阅读次数:172
Leetcode: Convert Sorted Array to Binary Search Tree
题目: Given an array where elements are sorted in ascending order, convert it to a height balanced BST.分析: 将已经排序好的数组转成高度平衡的二叉排序树。 依旧二分法。C++参考代码:/** * Definition for binary tree * struct TreeNode {...
分类:其他好文   时间:2015-04-09 13:51:49    阅读次数:112
CI框架学习之六 ( 常用函数封装 )
/** * 封装查询函数 */ public function get_what($table='',$where=array(),$fields = ' * '){ if( '' == $table ){ return false; } //查询并返回相关结果 $query = $this->db->select($fields)->where($where)-...
分类:其他好文   时间:2015-04-09 13:46:20    阅读次数:117
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!