登录
首页 » Java » AudioRecording-master

AudioRecording-master

于 2020-06-20 发布
0 224
下载积分: 1 下载次数: 1

代码说明:

说明:  不错的android录音代码,适合初学者学习(Android recording code is good)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • very cool style tab Tab
    非常酷Office2003风格的Tab选项卡-very cool style tab Tab
    2023-08-11 04:30:03下载
    积分:1
  • MagicFormula5.2
    轮胎模型魔术公式,非常完善,可以用于车辆动力学仿真(Tire model magic formula, very perfect, can be used for vehicle dynamics simulation)
    2020-12-22 16:09:07下载
    积分:1
  • xiong
    十六进制转换为十进制,是想应用程序可视化界面实现不同进制之间的转换。(sixteen to ten)
    2009-04-07 09:17:06下载
    积分:1
  • 数据结构(C语言版)严蔚敏 第四版紫皮
    说明:  数据结构、严蔚敏、课后习题、第四版紫色、电子书(Data structure, Fourth Edition, Yan Weimin, exercises after class)
    2021-03-03 12:59:33下载
    积分:1
  • SVPWM
    说明:  利用Simulink搭建的SVPWM波形发生器,需要的同学可以借鉴一下(The SVPWM waveform generator built by Simulink can be used for reference by students who need it.)
    2019-03-08 16:04:39下载
    积分:1
  • ansys maxwell 官方培训教程
    ansys Maxwell 官方 培训 教程。 里面有例子和对应的文件。(ANSYS Maxwell Official Training Course. There are examples and corresponding documents.)
    2020-11-27 16:49:31下载
    积分:1
  • [8] Multimedia resource allocation in mmwave
    [8] Multimedia resource allocation in mmwave
    2017-12-10 21:23:30下载
    积分:1
  • K10_Project_1229
    说明:  MDK平台下能够实现串口模拟的脚本,终端功能(The script and terminal functions of serial port simulation can be realized under MDK platform)
    2019-04-05 14:14:05下载
    积分:1
  • 人工蜂群算法
    说明:  人工蜂群算法的改进,基于混沌的人工蜂群算法,可求解优化问题(The improvement of artificial colony algorithm, based on chaos artificial colony algorithm, can solve the optimization problem)
    2019-05-17 14:57:48下载
    积分:1
  • 邮票问题:设一国家发行n种不同面值的邮票,并且每封信至多允许贴m张邮票,对于给定的m,n值,写一个算法求出从邮资1开始在增量为一的情况下可能获得的邮资值的最大连...
    邮票问题:设一国家发行n种不同面值的邮票,并且每封信至多允许贴m张邮票,对于给定的m,n值,写一个算法求出从邮资1开始在增量为一的情况下可能获得的邮资值的最大连续区域以及获得这个区域的各种可能面值的集合。如,当 n=4,m=5,若有面值为(1,4,12,21)的四种邮票,则邮资最大的连续区域为1到71。还有其他面值的四种邮票可组成同样大小的区域吗-stamp issue : Let a national issue n different denominations of the stamps and letters each allow up to m stamp affixed, to the m, n, write an algorithm derived from a postage in an increment of the circumstances, may obtain a postage value of the maximum continuous access to this region and regional various denominations could assemble. For example, when n = 4, m = 5, if the values of (1,4,12,21) of the four stamps, postage largest regional consecutive 1-71. There are four other denominations of the stamps can be the same size as the composition of the region? ?
    2022-02-24 19:12:53下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载