LeetCode Week5
来源:互联网 发布:基础版淘宝店铺布局 编辑:程序博客网 时间:2024/06/05 00:26
LeetCode Week5
EX.647
Given a string, your task is to count how many palindromic substrings in this string.
The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.
Example 1:
Input: "abc"Output: 3Explanation: Three palindromic strings: "a", "b", "c".
Example 2:
Input: "aaa"Output: 6Explanation: Six palindromic strings: "a", "a", "a", "aa", "aa", "aaa".
Solution:
i为中间的,判断i的左右两个字母是否一样,如果一样,j++,直至两边不同,跳出内层循环。外层循环i++。
内层的两个循环分别对应奇数个字母的字符串和偶数个字母的字符串。
class Solution {public: int countSubstrings(string s) { int res = 0, n = s.length(); for(int i = 0; i < n; i++){ for(int j = 0; i-j >= 0 && i+j < n && s[i-j] == s[i+j]; j++)res++; for(int j = 0; i-1-j >= 0 && i+j < n && s[i-1-j] == s[i+j]; j++)res++; } return res; }};
EX.553
Given a list of positive integers, the adjacent integers will perform the float division. For example, [2,3,4] -> 2 / 3 / 4.
However, you can add any number of parenthesis at any position to change the priority of operations. You should find out how to add parenthesis to get the maximum result, and return the corresponding expression in string format. Your expression should NOT contain redundant parenthesis.
Example:
Input: [1000,100,10,2]Output: "1000/(100/10/2)"Explanation:1000/(100/10/2) = 1000/((100/10)/2) = 200However, the bold parenthesis in "1000/((100/10)/2)" are >redundant, since they don't influence the operation priority. So you >should return "1000/(100/10/2)". Other cases:1000/(100/10)/2 = 501000/(100/(10/2)) = 501000/100/10/2 = 0.51000/100/(10/2) = 2
Solution:
只要知道,在连除的式子中加括号时,把括号括起第二个数和最后一个数时,得到的结果最大即可,例如样例中的1000/(100/10/2)
class Solution {public: string optimalDivision(vector<int>& nums) { if (nums.size() == 0) return ""; string res = to_string(nums[0]); if (nums.size() > 2) { res += "/("; for (int i = 1; i < nums.size()-1; i++) { res += to_string(nums[i]); res += "/"; } res += to_string(nums[nums.size()-1]); res += ")"; } else if (nums.size() == 2) { res += "/"; res += to_string(nums[nums.size()-1]); } return res; }};
- Leetcode Week5
- leetcode week5
- LeetCode Week5
- leetcode-month2-week5
- LeetCode题解 week5
- LeetCode#242 Valid Anagram (week5)
- week5
- LeetCode题解(Week5):207. Course Schedule
- Leetcode: 16. 3Sum Closest(Week5, Medium)
- [LeetCode-Algorithms-14] "Longest Common Prefix" (2017.10.2-WEEK5)
- [LeetCode-Algorithms-12] "Integer to Roman" (2017.10.2-WEEK5)
- [LeetCode-Algorithms-11] "Container With Most Water" (2017.10.2-WEEK5)
- week5-leetcode #8-String to Integer (atoi)[Medium]
- POMM-week5
- No5.week5
- Algorithm-week5
- LeetCode Week5:Recover Binary Search Tree、Binary Tree Maximum Path Sum
- LeetCode题解(Week5): 515. Find Largest Value in Each Tree Row
- MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applications个人理解
- Android studio如何添加HttClient
- 小公司如何应对老员工加薪的要求
- 解决VS在进行OpenGL编程中出现“无法启动此程序,因为计算机中丢失OPENGL.dll”
- C++ MFC / VS2013 之十六(对话框:字体对话框)
- LeetCode Week5
- 工具类
- 走穿23种设计模式-前五种,创建型模式详解
- 多项式乘法 快速傅里叶变换
- 面对对象之继承及其弊端(Java)
- Hdu 2242 考研路茫茫——空调教室 【边双联通+Dfs】
- 自传的开始,加油。
- 23:二维数组回形遍历
- 1055. 集体照 (25)