Improved tasks 12, 13, 14

Author: javadev

LeetCodeNet/G0001_0100/S0012_integer_to_roman/readme.md

@@ -67,10 +67,8 @@ Given an integer, convert it to a roman numeral.
 ## Solution
 
 ```csharp
-public class Solution
-{
-    public string IntToRoman(int num)
-    {
+public class Solution {
+    public string IntToRoman(int num) {
         var sb = new System.Text.StringBuilder();
         int m = 1000;
         int c = 100;
@@ -83,11 +81,9 @@ public class Solution
         return sb.ToString();
     }
 
-    private int Numerals(System.Text.StringBuilder sb, int num, int one, char cTen, char cFive, char cOne)
-    {
+    private int Numerals(System.Text.StringBuilder sb, int num, int one, char cTen, char cFive, char cOne) {
         int div = num / one;
-        switch (div)
-        {
+        switch (div) {
             case 9:
                 sb.Append(cOne);
                 sb.Append(cTen);

LeetCodeNet/G0001_0100/S0013_roman_to_integer/readme.md

@@ -69,17 +69,13 @@ Given a roman numeral, convert it to an integer.
 ## Solution
 
 ```csharp
-public class Solution
-{
-    public int RomanToInt(string s)
-    {
+public class Solution {
+    public int RomanToInt(string s) {
         int x = 0;
         char y;
-        for (int i = 0; i < s.Length; i++)
-        {
+        for (int i = 0; i < s.Length; i++) {
             y = s[i];
-            switch (y)
-            {
+            switch (y) {
                 case 'I':
                     x = GetX(s, x, i, 1, 'V', 'X');
                     break;
@@ -108,8 +104,7 @@ public class Solution
         return x;
     }
 
-    private int GetX(string s, int x, int i, int i2, char v, char x2)
-    {
+    private int GetX(string s, int x, int i, int i2, char v, char x2) {
         if (i + 1 == s.Length)
         {
             x += i2;

LeetCodeNet/G0001_0100/S0014_longest_common_prefix/readme.md

@@ -32,34 +32,25 @@ If there is no common prefix, return an empty string `""`.
 ## Solution
 
 ```csharp
-public class Solution
-{
-    public string LongestCommonPrefix(string[] strs)
-    {
-        if (strs.Length < 1)
-        {
+public class Solution {
+    public string LongestCommonPrefix(string[] strs) {
+        if (strs.Length < 1) {
             return "";
         }
-        if (strs.Length == 1)
-        {
+        if (strs.Length == 1) {
             return strs[0];
         }
         string temp = strs[0];
         int i = 1;
         string cur;
-        while (!string.IsNullOrEmpty(temp) && i < strs.Length)
-        {
-            if (temp.Length > strs[i].Length)
-            {
+        while (!string.IsNullOrEmpty(temp) && i < strs.Length) {
+            if (temp.Length > strs[i].Length) {
                 temp = temp.Substring(0, strs[i].Length);
             }
             cur = strs[i].Substring(0, temp.Length);
-            if (!cur.Equals(temp))
-            {
+            if (!cur.Equals(temp)) {
                 temp = temp.Substring(0, temp.Length - 1);
-            }
-            else
-            {
+            } else {
                 i++;
             }
         }