1.给出N和K还有一串数字字符串,按最小的代价把字符串变为K个相同数字的字符串,代价为原数字变为该数字后的差值。
public static void phoneNumber()
{
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int K = in.nextInt();
String s = in.next();
StringBuilder result = new StringBuilder();
int res = Integer.MAX_VALUE;
for(int i = 0; i < 10; i++)
{
StringBuilder sb = new StringBuilder(s);
int p = K;
int c = 0;
for(int j = 0; j < 10; j++)
{
for(int l = 0; l < N; l++)
{
if(p != 0 && (int)(sb.charAt(l)-'0') == i+j)
{
p--;
sb.setCharAt(l, (char)(sb.charAt(l)-j));
c += j;
}
if(j != 0)
{
if(p != 0 && sb.charAt(l)-'0' == i-j)
{
p--;
sb.setCharAt(l, (char)(sb.charAt(l)+j));
c += j;
}
}
}
}
if(res > c)
{
res = c;
result = sb;
}
}
System.out.println(res);
System.out.println(result.toString());
}
2.单项链表的快速排序
public static void Quick(LinkNode ln)
{
if(ln == null || ln.next == null)
return;
Quick(ln, null);
}
public static void Quick(LinkNode pHead, LinkNode tail)
{
if(pHead == null || pHead.next == tail)
return;
LinkNode pivot = partition(pHead, tail);
partition(pHead, pivot);
partition(pivot.next, tail);
}
public static LinkNode partition(LinkNode pHead, LinkNode tail)
{
if(pHead == null || pHead.next == tail)
return pHead;
LinkNode pivot = pHead;
int key = pivot.val;
for(LinkNode pNode = pHead.next; pNode != tail; pNode = pNode.next)
{
if(pNode.val < key)
{
pivot = pivot.next;
swap(pivot, pNode);
}
}
swap(pivot, pHead);
return pivot;
}
public static void swap(LinkNode l1, LinkNode l2)
{
int temp = l1.val;
l1.val = l2.val;
l2.val = temp;
}
3.最大合法括号长度
测试用例:()(()
import java.util.Scanner;
import java.util.Stack;
public class validBlacket {
public validBlacket() {
// TODO Auto-generated constructor stub
}
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner in = new Scanner(System.in);
String str = in.nextLine();
int[] flag = new int[str.length()];
Stack<Integer> stack = new Stack<Integer>();
for(int i = 0; i < str.length(); i++)
{
if(str.charAt(i) == '(')
stack.push(i);
if(str.charAt(i) == ')' && !stack.isEmpty())
{
int j = stack.peek();
if(str.charAt(j) == '(')
{
flag[j] = flag[i] = 1;
}
stack.pop();
}
}
int maxLen = 0;
int vLen = 0;
for(int i = 0; i < str.length(); i++)
{
if(flag[i] == 1)
{
vLen++;
}
else
{
maxLen = Math.max(maxLen, vLen);
vLen = 0;
}
}
System.out.println(maxLen);
}
}