码迷,mamicode.com
首页 >  
搜索关键字:find    ( 24186个结果
Ubuntu中的在文件中查找和替换命令
1、查找find /home/guo/bin -name /*.txt | xargs grep 'jdbc'查找 /home/guo/bin 目录下所有后缀为.txt 的文件(PS:/* 转义* 为统配符),通过 xargs 命令传递给 grep 作为文件参数grep 'jdbc' 所搜显示文件中...
分类:系统相关   时间:2015-06-10 12:02:33    阅读次数:233
(转)FFmpeg源代码简单分析:avformat_find_stream_info()
目录(?)[+]=====================================================FFmpeg的库函数源代码分析文章列表:【架构图】FFmpeg源代码结构图 -解码FFmpeg源代码结构图 -编码【通用】FFmpeg源代码简单分析:av_register_al...
分类:其他好文   时间:2015-06-10 11:42:58    阅读次数:156
Find Minimum in Rotated Sorted Array I II
Find Minimum in Rotated Sorted Array I Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Find the minimum element....
分类:其他好文   时间:2015-06-10 10:24:52    阅读次数:107
Leetcode[136]-Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra me...
分类:其他好文   时间:2015-06-10 08:59:53    阅读次数:114
Python批量重命名指定文件夹下文件的两种方法
#法一 import os path = "C://Python34//" for file in os.listdir(path): if os.path.isfile(os.path.join(path,file))==True: if file.find('.')<0: newname=file+'.jpg' os.re...
分类:编程语言   时间:2015-06-10 07:45:07    阅读次数:127
Maximum Depth of Binary Tree
Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest le...
分类:其他好文   时间:2015-06-10 06:33:56    阅读次数:99
Interleaving String
Givens1,s2,s3, find whethers3is formed by the interleaving ofs1ands2.For example,Given:s1="aabcc",s2="dbbca",Whens3="aadbbcbcac", return true.Whens3="...
分类:其他好文   时间:2015-06-10 00:59:36    阅读次数:110
Majority Element
Given an array of size n, find the majority element. The majority element is the element that appears more than ? n/2 ? times. You may assume that the array is non-empty and the majority element al...
分类:其他好文   时间:2015-06-09 23:42:35    阅读次数:154
Java for LeetCode 215 Kth Largest Element in an Array【Coming Soon】
Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For examp...
分类:编程语言   时间:2015-06-09 23:30:58    阅读次数:237
Java for LeetCode 219 Contains Duplicate II
Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] an...
分类:编程语言   时间:2015-06-09 23:20:17    阅读次数:134
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!