题目 Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". Example 1: Input: [“flower”,“flow”,“flight”] Output: “fl” [14] Longest Common Prefix LeetCode
一些文件，如配置文件，需要存在，但在本地运行时，需要填入一些敏感信息，因此不想git再追踪这些文件的变化 命令如下: git update-index --assume-unchanged 文件路径 例： git update-index --assume-unchanged src\main\resources\application.yml Git 不再追踪指定文件变化 Git
题目 Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 [13] Roman to Integer LeetCode
题目 Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward. **Example 1:** **Input:** 121 **Output:** true **Example 2:** **Input:** -121 **Output:** false **Explanation:** From left to right, it reads -121\. From right to left, it becomes 121-. Therefore it is not a palindrome. **Example 3:** **Input:** 10 **Output:** false **Explanation:** Reads 01 from right to left. Therefore it is not a palindrome. **Follow up:** Coud you solve it .... [9] Palindrome Number LeetCode
题目 Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Output: -321 Example 3: Input: 120 Output: 21 Note: Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows. [7] Reverse Integer LeetCode
题目 Two Sum Given an array of integers, return **indices** of the two numbers such that they add up to a specific target. You may assume that each input would have **_exactly_** one solution, and you may not use the _same_ element twice. Example: Given nums = [2, 7, 11, 15], target = 9, Because nums[**0**] + nums[**1**] = 2 + 7 = 9, return [**0**, **1**]. [1] Two Sum LeetCode
云飞扬的个人博客