This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
//Version 1 Version 2 Result | |
//1.11.17 2.3.5 2.3.5 | |
//2.1 2.1.3 2.1.3 | |
//2.3.5 2.4 2.4.0 | |
//3.1 2.4 3.1.0 | |
//3.3 3.2.9 3.3.0 | |
//7.2.71 7.2.71 7.2.71 | |
string s1 = "2.1"; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
check wellformedbracing | |
Input Result Comment | |
“(( ))” True | |
“( )( )” True | |
“(( )))((( ))” False Although it has the same amount of opening and closing braces, | |
it is not properly nested | |
“((( )” False No suitable bracing |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Input : [“hello”, “world”, “message”] | |
Separator: “ +++ ” | |
Result: “hello +++ world +++ message” | |
*/ | |
using System; | |
using System.Collections.Generic; | |
var input = new List<string>{"hello","world","message"}; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Given a string s, return the longest palindromic substring in s. | |
Example 1: | |
Input: s = "babad" | |
Output: "bab" | |
Explanation: "aba" is also a valid answer. | |
Example 2: | |
Input: s = "cbbd" | |
Output: "bb" | |
*/ |
NewerOlder