本文主要是介绍【ARTS】01_25_左耳听风-201900429~20190505,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
ARTS:
- Algrothm: leetcode算法题目
- Review: 阅读并且点评一篇英文技术文章
- Tip/Techni: 学习一个技术技巧
- Share: 分享一篇有观点和思考的技术文章
Algorithm
【leetcode】26. Remove Duplicates from Sorted Array
https://leetcode.com/problems/remove-duplicates-from-sorted-array/
1)problem
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
Example 1:
Given nums = [1,1,2],Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.It doesn't matter what you leave beyond the returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.It doesn't matter what values are set beyond the returned length.
Clarification:
Confused why the returned value is an integer but your answer is an array?
Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
Internally you can think of this:
// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {print(nums[i]);
}
2)answer
删除数组中重复的值,返回数组的当前长度
3)solution
class Solution:def removeDuplicates(self, nums):if not nums:return 0count = 0for i in range(len(nums)):if nums[count] != nums[i]:count += 1nums[count] = nums[i]return count + 1if __name__ == '__main__':c = Solution()nums = [0, 0, 1, 1, 1, 2, 2, 3, 3, 4]c.removeDuplicates(nums)
Review
【漏洞挖掘】利用PHP应用程序中的远程文件包含(RFI)并绕过远程URL包含限制
1)场景
绕过远程URL包含限制。在PHP开发环境php.ini配置文件里”,allow_url_include“为“off”的情况下,不允许PHP加载远程HTTP或FTP url包含远程文件。但是使用SMB依旧可以加载。
2)问题难点
PHP测试环境:5.5.11
SMB环境:Linux SAMBA
3)解决问题的方法
远程文件包含用SMB加载PHP Webshell
4)方法细节
利用PHP应用程序中的远程文件包含(RFI)并绕过远程URL包含限制
https://www.cnblogs.com/17bdw/p/10987338.html
Tip
【安全开发】被动安全扫描实践
1)场景
2)问题难点
3)解决思路
4)方法细节
中通分布式被动安全扫描实践
https://mp.weixin.qq.com/s/n9N6Nkg_RYEvPM2WnlG45w
漫谈漏洞扫描器的设计与开发
https://thief.one/2018/03/16/1/
Share
【业务】极客时间-左耳听风-程序员攻略-分布式架构入门
1)场景
分布式架构入门
2)问题难点
分布式架构入门
3)解决思路
-
分布式架构入门
-
分布式理论
-
小结
4)方法细节
极客时间-左耳听风-程序员攻略-分布式架构入门
https://www.cnblogs.com/17bdw/p/10854521.html
这篇关于【ARTS】01_25_左耳听风-201900429~20190505的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!